Cable TV refers to the transmission of visual and audio signals to the public by laying cables. Article 5 of the Cable Radio and Television Law says: ¡§System operators installing the networks themselves shall apply to the roads authority for approval if the networks are to be laid underground¡K¡¨ The roads authority on the regional level is the Township Office. Road right granted by the roads authority is usually valid for one year. Cable TV is a licensed business; business licenses issued by the Government Information Office, Executive Yuan are in 9-year term. Although it is subject to the restrictions and regulations of the same laws as public utilities, the business does not enjoy the deserved protection. Hence, system operators often come across setbacks in their operation, which are undoubtedly potential threats to their survival and development. However, contrasting this to the development history of Taiwan¡¦s cable TV industry, it seems from the result that the government institution has played a critical role. Importance of the government¡¦s initiative to moderately liberalize the public goods for creation of an open environment, and to put more emphasis on the overall system planning for the industry development at different stages is beyond words. This study not only analyzes the impact of the Cable Radio and Television Law and regional laws on the system, but also takes real-life examples into consideration, to explain the importance of public interest and freedom of speech for liberalization of routing rights. The question is tackled in different approaches and from different viewpoints, in order to understand the problems and difficulties that system operators face when applying for routing rights from the Township Office. The study expects to provide some positive assistance and suggestions to the industry and the government, for avoidance of improper market intervention.

No description available.

This study examines the effect of strategy and task uncertainty on management accounting system (MAS) design. Mas design was defined in terms of the perceived usefulness of several information characteristics which may be associated with an MAS. We collected 87 respondents by surveying 500 middle managers of public owned companies in Taiwan, and used path analysis to test our hypotheses. The findings indicated that¡G1. There is a significant positive relation between strategy and task uncertainty. Furthermore, task difficulty and task variability also have significant positive relations with strategy respectively. 2. Strategy and the perceived usefulness of broad scope MAS information have both positive direct and indirect relations through task uncertainty. Besides, through task variability, there is an indirect relation between strategy and the perceived usefulness of broad scope MAS information, but there isn¡¦t an indirect relation between strategy and the perceived usefulness of broad scope MAS information via task difficulty. 3. A direct relationship between strategy and the perceived usefulness of aggregated MAS information was not found.

Message routing is a fundamental function of a network, and fault-tolerance is an important tool to ensure the quality of service of a network. Assume that network contain only one faulty element. In order to ensure the message can be arrived. We present a fault-tolerant message routing algorithm which being the secondary path, as the optimal path can't be connected in the double-loop networks.

The use of Internet has revolutionized the way information is exchanged, changed business paradigms and put mission critical and sensitive systems online. Any dis- ruption of this connectivity and the plethora of services provided results in significant damages to everyone involved. Denial of Service (DoS) attacks are becoming increas- ingly common and are the cause of lost time and revenue. Flooding type DoS attacks use spoofed IP addresses to disguise the attackers. This makes identification of the attackers extremely difficult. This work proposes a new scheme that allows the victim of a DoS attack to identify the correct origin of the malicious traffic. The suggested mechanism requires routers to mark packets using adjusted probabilistic marking. This results in a lower number of packet-markings required to identify the traffic source. Unlike many related works, we use the existing IPv4 header structure to incorporate these markings. We simulate and test our algorithms using real Internet trace data to show that our technique is fast, and works successfully for a large number of distributed attackers.

This dissertation focuses on developing algorithms that generate tool paths for free-form surfaces based on accuracy of desired manufactured part. A manufacturing part is represented by mathematical curves and surfaces. Using the mathematical representation of the manufacturing part, we generate reliable and near optimal tool paths as well as cutter location (CL) data file for postprocessing. This algorithm includes two components. First is the forward-step function which determines maximum distance called forward- step between two cutter contact (CC) points with given tolerance. This function is independent of the surface type and is applicable to all continuous parametric surfaces that are twice differentiable. The second component is the side-step function which determines maximum distance called side-step between two adjacent tool paths with a given scallop height. This algorithm reduces manufacturing and computing time as well as the CC points while keeping the given tolerance and scallop height in the tool paths. Several parts, for which the CC points are generated using the proposed algorithm, are machined using a three axes milling machine. As part of the validation process, the tool paths generated during machining are analyzed to compare the machined part and the desired part.

This dissertation discusses two independent topics: a resource-constrained shortest-path problem (RCSP) and a literature review on scheduling problems involving sequence-dependent setup (SDS) times (costs). RCSP is often used as a subproblem in column generation because it can be used to solve many practical problems. This dissertation studies RCSP with multiple resource constraints on an acyclic graph, because many applications involve this configuration, especially in column genetation formulations. In particular, this research focuses on a dynamic RCSP since, as a subproblem in column generation, objective function coefficients are updated using new values of dual variables at each iteration. This dissertation proposes a pseudo-polynomial solution method for solving the dynamic RCSP by exploiting the special structure of an acyclic graph with the goal of effectively reoptimizing RCSP in the context of column generation. This method uses a one-time “preliminary” phase to transform RCSP into an unconstrained shortest path problem (SPP) and then solves the resulting SPP after new values of dual variables are used to update objective function coefficients (i.e., reduced costs) at each iteration. Network reduction techniques are considered to remove some nodes and/or arcs permanently in the preliminary phase. Specified techniques are explored to reoptimize when only several coefficients change and for dealing with forbidden and prescribed arcs in the context of a column generation/branch-and-bound approach. As a benchmark method, a label-setting algorithm is also proposed. Computational tests are designed to show the effectiveness of the proposed algorithms and procedures. This dissertation also gives a literature review related to the class of scheduling problems that involve SDS times (costs), an important consideration in many practical applications. It focuses on papers published within the last decade, addressing a variety of machine configurations - single machine, parallel machine, flow shop, and job shop - reviewing both optimizing and heuristic solution methods in each category. Since lot-sizing is so intimately related to scheduling, this dissertation reviews work that integrates these issues in relationship to each configuration. This dissertation provides a perspective of this line of research, gives conclusions, and discusses fertile research opportunities posed by this class of scheduling problems. since, as a subproblem in column generation, objective function coefficients are updated using new values of dual variables at each iteration. This dissertation proposes a pseudo-polynomial solution method for solving the dynamic RCSP by exploiting the special structure of an acyclic graph with the goal of effectively reoptimizing RCSP in the context of column generation. This method uses a one-time

A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, a communication tree structure connecting sensor nodes to the base station (sink or root) is dynamically reconfigured during information dissemination. Unlike other location based routing approaches, INP does not take any support from a high costing system that gives position information such as GPS. For reconfigurations, INP uses only local relational information in the tree structure among nearby nodes by collaboration between the nodes that does not need global maintenance, so that INP is energy efficient and it scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme (SWR) that uses a global metric and the modified GRAdient broadcast scheme (GRAB-F) that uses interleaving multiple paths by computation and by simulations. The comparisons demonstrate that using local relative information is mostly enough for reconfigurations, and it consumes less energy and mostly better delivery rates than other algorithms especially in dense environments. For the control observer to know the network health status, two new diagnosis algorithms (Repre and Local) that deal with crash faults for wireless sensor networks are also introduced in the dissertation. The control observer knows not only the static faults found by periodic testing but also the dynamic faults found by a path reconfiguration algorithm like INP that is invoked from evidence during information dissemination. With based on this information, the control observer properly treats the network without lateness. Local algorithm is introduced for providing scalability to reduce communication energy consumption when the network size grows. The performance of these algorithms is computationally compared with other crash faults identification algorithm (WSNDiag). The comparisons demonstrate that maintaining the communication tree with local reconfigurations in Repre and Local needs less energy than making a tree per each diagnosis procedure in WSNDiag. They also demonstrate that providing scalability in Local needs less energy than other approaches.

With the cross-strait interactions become more and more prevalent, Chinese visitors¡¦ traveling to Taiwan has become a important subject. Governments, industries and scholars in Taiwan are all estimating how much this will contribute to the Taiwan economy development. To explore the immense potential tourism market, this research adopts quantitative technical analysis, include the following issues into discussion: (1) the generation of destination images from the perspectives of potential Mainland China travelers to Taiwan; (2) the factors that effect tourists¡¦ impression owing to the history issues and cross-strait relations; (3) the influence of China¡¦s political and social conditions on Taiwan¡¦s tourism image and their cause-effect relations; (4) the destination image effect of Taiwan¡¦s present direct/indirect limitation policy on China tourists.Based on the destination image model by Baloglu & McCleary (1990), the research adopts a student questionnaire survey targeting at potential visitors from Mainland China who have never been to Taiwan. A total number of 671 valid samples are geographically divided into two groups: internal region of China and coastal areas. The two variables are then analyzed with SEM to construct the destination image path model. The result shows that cause-effect relations exist on the mediators of ¡§perception/cognition of destination¡¨, ¡§affective evaluation¡¨ and ¡§overall destination image¡¨. Independent variables of ¡§the significance of information types¡¨ and ¡§tourist motivation¡¨ support the result of the past studies. However, ¡§the amount of information¡¨ on Taiwan¡¦s tourism image presents different result from the past studies, which also modifies the hypothesis of information amount variable in the model developed by Baloglu & McCleary (1990).The result reveals that independent variable of ¡§destination limitation/control¡¨ has obvious cause-effect relation with mediator of ¡§perception/cognition of destination¡¨, which indirectly affects the formation of destination image. The comparison of three construction models formed by the destination image all indicates that the insufficiency of tourist information may lead to the unsupportable obvious cause-effect relation on image development. The independent variable of ¡§internal region of China¡¨ presents better cause-effect relation with ¡§affective evaluation¡¨ mediator while ¡§coastal areas¡¨ shows better relation with ¡§perception/cognition of destination¡¨.

A three-link, single-degree-of-freedom mechanism, named the Spirograph linkage, is investigated in this thesis. What is special about this open-chain mechanism is that, by the use of a chain and two sprockets and therefore maintaining a constant angular velocity ratio between the two rotating links, the path traced by this mechanism can be shown to be either an epitrochoid or a hypotrochoid. Through the understanding of the formulations of the trochoids, the relations between the design parameters of the Spirograph linkage and the corresponding path patterns are derived. With certain design parameter combinations, the Spirograph linkage is able to feature paths with cusps, which means dwells and are useful in applications. A design chart for such cusp-generating Spirograph linkages is then included in the thesis for the sake of convenience. In addition, by matching the link-length ratio with the angular velocity ratio, ways for finding closed single-loop paths of the Spirograph linkage are also studied. As for the path generation problems concerning only a fraction of the entire path, we compare results given by the classical precision point scheme with assorted combinations of initial conditions. In the latter part of the thesis, non-circular sprockets are also introduced to provide the Spirograph linkage additional freedom to cope with the demand of more flexible, i.e., non-symmetrical shapes of the path. However, many constraints are to be imposed on the design process of such linkages, and these design limitations are elaborated in the thesis. At last, the use of Newton¡¦s method, the selection of the proper type of trochoids, the application of the envelop method for obtaining the profile of the non-circular sprocket, the analyses of angular velocity ratios, etc. are all exemplified in the several numerical examples of the thesis.