In the generation of educational reform, we have always wondering what kind of important ability has been taught in the curriculum? Financial literacy is an essential life skill (OECD, 2017). No matter what kinds of occupation will a person have, he or she must know how to manage his or her asset. In this research, we explored that if students’ math motivation, math anxiety, and financial concept would change or not after they received the hybrid financial courses in 4 weeks. We used math motivation and math anxiety as grouping variables, then use k-mean clustering to separate students into two groups. Two-way mixed-design ANOVAs were conducted to test the mean differences and change of math motivation, math anxiety, and financial concept across time points between different groups. We found only the significant change of math anxiety from students after they received the financial courses, while math motivation and financial concept kept constant.

Technology of next generation sequencing to detect pathogens of sample can impact human health by revealing pathogens which cause disease. Several workflow has developed in purposed to detect pathogens in next generation sequencing data. However, the requirement of computation power of these workflows limited the application. The time consuming problem make the workflow difficult to detect datasets with large sample size. Here we presented Patho-finder, a fast and accurate workflow designed for detecting pathogen in RNA sequencing data. We have evaluated performance of Patho-finder by three aspects. First, we evaluate performance by alter the data features, to see how Patho-finder work under different simulation conditions. Next, we compare the time consuming and accuracy between Patho-finder and existing workflow. At last, we used Patho-finder on the RNA-seq of cell lines with known virus-infected. The validation result demonstrated our approach could finish the task in real datasets.

Today, charging stations (CSs) for electric vehicles (EVs) are much less popular than gas stations. Therefore, searching and selecting CSs is an important issue for the drivers of EVs. This paper investigates the EV charging problem. We propose two types of CS-selection algorithms. The first type only utilizes local information of an EV. The second type utilizes the global information obtained from mobile computing. Specifically, the EVs interact with a Global CS-selection (GCS) server through the mobile telecommunications network. Our study indicates that by using the global information (specifically the workload status of each CS), the EVs can be effectively charged with short waiting times at the CSs.

It is undesired to drop an ongoing call in wireless systems; however, call dropping may occur in two situations, one of which is hand-off between cells in cellular wireless networks, the other of which is channel withdrawal in wireless systems with spectrum leasing. Channel reservation is a common solution to reduce the two types of call dropping. Optimal numbers of reservation channels were separately found before to reduce the two types of call dropping respectively. This paper studies a cellular wireless network which leases spectrum bands from another system. Due to the gain of resource sharing, the two reservations can be combined into a reservation pool, which, however, increases the complexity of selecting the optimal number of the channels in the pool; this selection is further complicated for heterogenous traffic because different traffic types have different tolerances to the exhaustion of channels. Therefore, it is critical to reserve the optimal number of channels in a pool such that the quality-of-services of different types of traffic are satisfied while throughput is maximized. We develop a three-dimensional Markov chain to analyze the performances of the channel reservation in a cellular wireless network with spectrum leasing. Based on the analysis, we use an example to demonstrate that the selected parameters of reservation guarantee the quality-ofservice requirements of different types of traffic while maximize throughput.

Image reconstruction from limited number of sampled data typically leads to infinitely many data-consistent solutions, and it is usually difficult to specify an accurate image even in the absence of noise. One solution to this non-uniqueness problem is to incorporate prior knowledge into the estimation procedure, and the prior discrete Fourier transform (PDFT) algorithm is a good example based on this aspect. The PDFT can promisingly provide a high-quality solution by solving the best approximation in a user-designed Hilbert space as the image estimate, while its computational cost with large data sets is unfavorable. In our previous research achievements, the implementation of the iterative algebraic reconstruction techniques (ART) and conjugate gradient (CG) method into the PDFT successfully improves computational efficiency significantly, without degrading the image quality. In this paper, some other well-known iterative algorithms were implemented in the PDFT and their performances were investigated.

Owing to the applications provided more convenient and less expensive, 3G network service are getting popular than ever. In addition to the WLAN infrastructures are built ubiquitously. The integration between these two systems is unavoidable. 3GPP defines a node, PDG (Packet Data Gateway) to be the entry point for user in WLAN to access 3G PS services. The PDG is suggested to be composed of TTG and GGSN. To build a connection from WLAN UE to the node within 3G PS domains, IPSec tunnel is established between the WLAN UE and TTG via IKEv2 protocol. TTG has to transfer the IPSec tunnel to GTP tunnel toward GGSN. The first issue we addressed in this paper is how to do the translation between IPSec tunnel and GTP tunnel. We observe the mapping relation between the TS payload and TFT packet filter. Vertical handoff is another issue in this heterogeneous network. In order to minimize packet loss and handoff latency when UE moves to 3G networks, we propose a practical mechanism to reuse the PDP Context which was created when UE was in WLAN.

This paper presents base-centric routing (BCR) protocol, which is designed for multihop cellular networks (MCNs) for wireless data communications. MCN, in which packets are multi-hopped to their destination, is hybrid of traditional single-hop cellular networks (SCNs) and ad-hoc networks architecture. Because the existing routing protocols designed for ad-hoc networks are not suitable for MCN, herein, a hybrid of table-driven and demand-driven protocols with base-centric computing is designed. The base tracks network topology by the table-driven method and can thus compute paths for MSs, constituting base-centric computing. When paths are needed by MSs, when is demand-driven, the path query messages are unicast to the base. If MSs do not obtain paths from the base, then path query messages will be flooded as in AODV. Simulation yields the following conclusions. The throughput of MCN increases as radio distance decreases and is higher than that of SCN. When the radio distance in MCN is the same as that in SCN, the throughput in MCN is about twice that in SCN. Moreover, the improvement can be by up to a factor of three when the radio distance in MCN is 1/4 of that in SCN. The hybrid protocol outperforms AODV because with base-centric computing, path query messages can be unicast to the base and the overhead is greatly reduced. Without mobility, UDP outperforms TCP. However, with mobility, TCP outperforms UDP.

The quality of service (QoS) reservations in differentiated service (DiffServ) networks can be classified into two sets: book-ahead (BA) requests and instantaneous requests (IRs). When an admitted BA request becomes active, some ongoing IRs are dropped when the bandwidth is insufficient for supporting both IRs and BA requests. The admission control should predict the lifetime, i.e. look-ahead time, of the IRs to prevent the admitted IRs from being dropped. The control should then check whether the available bandwidth during the look-ahead time is sufficient for the incoming IRs. We propose an application-aware look-ahead admission control for IRs, which determines the look-ahead time for specific types of IR applications. An admitted BA request might block subsequent ones that could bring more effective revenue. Thus, we propose the deferrable model of the admission control for BA requests. Simulation results indicate that the application-aware look-ahead admission control successfully reduces the dropping probability and wasted revenue of IRs by up to 10 times and 30%, respectively. Besides, the deferrable model indeed results in more BA effective revenue.

General Packet Radio Service (GPRS) uses a two-stage mechanism to allocate uplink radio resource to mobile stations (MSs). In stage-1, the base station (BS) assigns several packet data channels (PDCHs) to an MS. Furthermore, a PDCH may be assigned to multiple MSs. In stage-2, therefore, the BS selects one of the multiplexed MSs in a PDCH to use the radio resource. In this work, maintaining a load balance between PDCHs in stage-1 is examined and several selection schemes to lower the mis-selection rate in stage-2 are proposed. From our simulation results, the cost deduced from the poor load balancing and selection schemes render a lower system throughput and a non-negligible increase in packet queuing delay. Among the various stage-2 selection policies, round robin with linearly-accumulated adjustment (RRLAA) has the lowest mis-selection rate and outperforms the one without any heuristic up to 50%.

This work presents a new architecture, multihop cellular network (MCN), for wireless communications. MCN preserves the benefit of conventional single-hop cellular networks (SCN) where the service infrastructure is constructed by fixed bases, and it also incorporates the flexibility of ad-hoc networks where wireless transmission through mobile stations in multiple hops is allowed. MCN can reduce the required number of bases or improve the throughput performance, while limiting path vulnerability encountered in ad-hoc networks. In addition, MCN and SCN are analyzed, in terms of mean hop count, hop-by-hop throughput, end-to-end throughput, and mean number of channels (i.e. simultaneous transmissions) under different traffic localities and transmission ranges. Numerical results demonstrate that the throughput of MCN exceeds that of SCN, the former also increases as the transmission range decreases. The above results can be accounted for by the different orders, linear and square, at which the mean hop count and mean number of channels increase, respectively.

We present a prototype for a new architecture, MCN (multihop cellular network), implemented over a wireless LAN platform. MCN preserves the virtue of traditional single-hop cellular networks where the service infrastructure is constructed by many bases, but it also adds the flexibility of ad-hoc networks where wireless transfer through mobile stations in multiple hops is allowed. The MCN can reduce the number of required bases or improve the throughput performance. On IEEE 802.11 compliant wireless LAN products, a bridging protocol, our BMBP (base-driven multihop bridging protocol), runs between mobile stations and access points to build bridging tables. The demonstration shows that MCN is a feasible architecture for wireless LANs.

We present a method to compute the path bandwidth for the DSDV (destination-sequenced distance-vector) based routing algorithm. The addressed network does not necessarily have a cellular structure and could have no fixed infrastructure. This network can be either stand-alone, or connected to the wired network. Each mobile station has to relay packets for others, thus achieving multihop routing. To calculate the available bandwidth of a path in this environment, it is incorrect to simply compute the minimum bandwidth of the links along the path. There are two crucial steps in the path bandwidth computation process of this multihop environment: (1) intersecting the sets of common free slots of two adjacent links, and (2) dividing the intersection for the adjacent links to share. We present two bandwidth computation rules including the half rule and the floating rule. Numerical results are given to evaluate the performance of applying these rules to the DSDV-based QoS routing algorithm.