基于GIS的高速公路养护管理信息系统的设计与开发

China is experiencing a rapid development of highway ever since 1990s. By the end of 2004, the total length of the highway summed up to 33 thousand kilometers, ranking 2n in the world. After the open of highway, the accumulation of time and traffic causes the decrease of its capability. To ensure its good quality, security and operation functions, we should take some reasonable measures to maintain it periodically. At present, a big problem is that the traditional maintain measures can no longer meet the increasing requirements. Due to the characters of highway, the relationship of various maintenance data and geographic positions is even closer than any others. If we wan to improve the quality and efficiency of the maintenance work, particularly when there is need for decision-making, a great number of data that is related to geographic positions are absolutely necessary. Evidently, Geographical Information System (GIS) has incomparably advantages in dealing with these spatial information. As a result, a management system for highway maintenance work based on GIS became inevitable for the development of the maintenance of highway. The purpose of this paper is to establish a management system for highway maintenance work base on Geographical Information System (GIS), Global Positioning System (GPS) and spatial database, to manage all kinds of problems encountered in the work, and to provide support on information and methods. My study mainly includes: (1) Analysis on the current status of the maintenance and management work; overview on the history of domestic and international highway maintenance management systems; identifying the necessity and importance for establishing a management system for highway maintenance work based on GIS. (2) Based on the requirement analysis, I proposed a general design for this management system, and discussed the objective, design principles, framework, systematical structure and function design. (3) Outdoor data collection is not only a prime way to understand the current situation of the road, but also an important method for data update after the system is put into use. This paper also intends to establish a set of plan to collect data efficiently and precisely which is based on GIS and GPS technologies. (4) The maintenance management database is a supporting platform for various maintenance decision-makings. Such decisions need the support of a great amount of data, which would cause other problems, such as the diversity of the data source, difference of data formats. This paper also discussed how to deal with these problems and establish such a database. (5) To propose an approach to assess the condition of pavement, based on GIS and related maintenance models. Among all the maintenance models, the two for assessing and forecasting pavement condition are the most important and mature. This paper also analyzed these two models and introduced them in terms of the integration of models. (6) This paper took the Guangshen Highway for example, explaining how to realize a GIS for management of highway maintenance work.

Truth Maintenance Systems for Problem Solving

The thesis developed here is that reasoning programs which take care to record the logical justifications for program beliefs can apply several powerful, but simple, domain-independent algorithms to (1) maintain the consistency of program beliefs, (2) realize substantial search efficiencies, and (3) automatically summarize explanations of program beliefs. These algorithms are the recorded justifications to maintain the consistency and well founded basis of the set of beliefs. The set of beliefs can be efficiently updated in an incremental manner when hypotheses are retracted and when new information is discovered. The recorded justifications also enable the pinpointing of exactly whose assumptions which support any particular belief. The ability to pinpoint the underlying assumptions is the basis for an extremely powerful domain-independent backtracking method. This method, called Dependency-Directed Backtracking, offers vastly improved performance over traditional backtracking algorithms.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.

Overlay Network Creation and Maintenance with Selfish Users

Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications including routing, file sharing, content distribution, and server deployment. Previous work has focused on devising practical neighbor selection heuristics under the assumption that users conform to a specific wiring protocol. This is not a valid assumption in highly decentralized systems like overlay networks. Overlay users may act selfishly and deviate from the default wiring protocols by utilizing knowledge they have about the network when selecting neighbors to improve the performance they receive from the overlay. This thesis goes against the conventional thinking that overlay users conform to a specific protocol. The contributions of this thesis are threefold. It provides a systematic evaluation of the design space of selfish neighbor selection strategies in real overlays, evaluates the performance of overlay networks that consist of users that select their neighbors selfishly, and examines the implications of selfish neighbor and server selection to overlay protocol design and service provisioning respectively. This thesis develops a game-theoretic framework that provides a unified approach to modeling Selfish Neighbor Selection (SNS) wiring procedures on behalf of selfish users. The model is general, and takes into consideration costs reflecting network latency and user preference profiles, the inherent directionality in overlay maintenance protocols, and connectivity constraints imposed on the system designer. Within this framework the notion of user’s "best response" wiring strategy is formalized as a k-median problem on asymmetric distance and is used to obtain overlay structures in which no node can re-wire to improve the performance it receives from the overlay. Evaluation results presented in this thesis indicate that selfish users can reap substantial performance benefits when connecting to overlay networks composed of non-selfish users. In addition, in overlays that are dominated by selfish users, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naïve wiring strategies. To capitalize on the performance advantages of optimal neighbor selection strategies and the emergent global wirings that result, this thesis presents EGOIST: an SNS-inspired overlay network creation and maintenance routing system. Through an extensive measurement study on the deployed prototype, results presented in this thesis show that EGOIST’s neighbor selection primitives outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, these results demonstrate that EGOIST is competitive with an optimal but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overheads. This thesis also studies selfish neighbor selection strategies for swarming applications. The main focus is on n-way broadcast applications where each of n overlay user wants to push its own distinct file to all other destinations as well as download their respective data files. Results presented in this thesis demonstrate that the performance of our swarming protocol for n-way broadcast on top of overlays of selfish users is far superior than the performance on top of existing overlays. In the context of service provisioning, this thesis examines the use of distributed approaches that enable a provider to determine the number and location of servers for optimal delivery of content or services to its selfish end-users. To leverage recent advances in virtualization technologies, this thesis develops and evaluates a distributed protocol to migrate servers based on end-users demand and only on local topological knowledge. Results under a range of network topologies and workloads suggest that the performance of the distributed deployment is comparable to that of the optimal but unscalable centralized deployment.

Combining and choosing case base maintenance algorithms

Case-Based Reasoning (CBR) uses past experiences to solve new problems. The quality of the past experiences, which are stored as cases in a case base, is a big factor in the performance of a CBR system. The system's competence may be improved by adding problems to the case base after they have been solved and their solutions verified to be correct. However, from time to time, the case base may have to be refined to reduce redundancy and to get rid of any noisy cases that may have been introduced. Many case base maintenance algorithms have been developed to delete noisy and redundant cases. However, different algorithms work well in different situations and it may be difficult for a knowledge engineer to know which one is the best to use for a particular case base. In this thesis, we investigate ways to combine algorithms to produce better deletion decisions than the decisions made by individual algorithms, and ways to choose which algorithm is best for a given case base at a given time. We analyse five of the most commonly-used maintenance algorithms in detail and show how the different algorithms perform better on different datasets. This motivates us to develop a new approach: maintenance by a committee of experts (MACE). MACE allows us to combine maintenance algorithms to produce a composite algorithm which exploits the merits of each of the algorithms that it contains. By combining different algorithms in different ways we can also define algorithms that have different trade-offs between accuracy and deletion. While MACE allows us to define an infinite number of new composite algorithms, we still face the problem of choosing which algorithm to use. To make this choice, we need to be able to identify properties of a case base that are predictive of which maintenance algorithm is best. We examine a number of measures of dataset complexity for this purpose. These provide a numerical way to describe a case base at a given time. We use the numerical description to develop a meta-case-based classification system. This system uses previous experience about which maintenance algorithm was best to use for other case bases to predict which algorithm to use for a new case base. Finally, we give the knowledge engineer more control over the deletion process by creating incremental versions of the maintenance algorithms. These incremental algorithms suggest one case at a time for deletion rather than a group of cases, which allows the knowledge engineer to decide whether or not each case in turn should be deleted or kept. We also develop incremental versions of the complexity measures, allowing us to create an incremental version of our meta-case-based classification system. Since the case base changes after each deletion, the best algorithm to use may also change. The incremental system allows us to choose which algorithm is the best to use at each point in the deletion process.

Moral shielding: A grounded theory of integrity maintenance in multidisciplinary teams

Using a classic grounded theory methodology (CGT), this study explores the phenomenon of moral shielding within mental health multidisciplinary teams (MDTS). The study was located within three catchment areas engaged in acute mental health service practice. The main concern identified was the maintenance of a sense of personal integrity during situational binds. Through theoretical sampling thirty two practitioners, including; doctors, nurses, social workers, occupational therapists, counsellors and psychologists, where interviewed face to face. In addition, emergent concepts were identified through observation of MDTs in clinical and research practice. Following a classic grounded theory methodology, data collection and analysis occurred simultaneously. A constant comparative approach was adopted and resulted in the immergence of three sub- core categories; moral abdication, moral hinting and pseudo-compliance. Moral abdication seeks to re-position within an event in order to avoid or deflect the initial obligation to act, it is a strategy used to remove or reduce moral ownership. Moral gauging represents the monitoring of an event with the goal of judging the congruence of personal principles and commitments with that of other practitioners. This strategy is enacted in a bid to seek allies for the support of a given moral position. Pseudo-compliance represents behaviour that hides desired principles and commitments in order to shield them from challenge. This strategy portrays agreement with the dominant position within the MDT, whilst holding a contrary position. It seeks to preserve a reservoir of emotional energy required to maintain a sense of personal integrity. Practitioners who were successful in enacting moral shielding were found to not experience significant emotional distress associated with the phenomenon of moral distress; suggesting that these practitioners had found mechanisms to manage situational binds that threatened their sense of personal integrity.

The treatment of landfill leachate using natural systems

Leachate may be defined as any liquid percolating through deposited waste and emitted from or contained within a landfill. If leachate migrates from a site it may pose a severe threat to the surrounding environment. Increasingly stringent environmental legislation both at European level and national level (Republic of Ireland) regarding the operation of landfill sites, control of associated emissions, as well as requirements for restoration and aftercare management (up to 30 years) has prompted research for this project into the design and development of a low cost, low maintenance, low technology trial system to treat landfill leachate at Kinsale Road Landfill Site, located on the outskirts of Cork city. A trial leachate treatment plant was constructed consisting of 14 separate treatment units (10 open top cylindrical cells [Ø 1.8 m x 2.0 high] and four reed beds [5.0m x 5.0m x 1.0m]) incorporating various alternative natural treatment processes including reed beds (vertical flow [VF] and horizontal flow [HF]), grass treatment planes, compost units, timber chip units, compost-timber chip units, stratified sand filters and willow treatment plots. High treatment efficiencies were achieved in units operating in sequence containing compost and timber chip media, vertical flow reed beds and grass treatment planes. Pollutant load removal rates of 99% for NH4, 84% for BOD5, 46% for COD, 63% for suspended solids, 94% for iron and 98% for manganese were recorded in the final effluent of successfully operated sequences at irrigation rates of 945 l/m2/day in the cylindrical cells and 96 l/m2/day in the VF reed beds and grass treatment planes. Almost total pathogen removal (E. coli) occurred in the final effluent of the same sequence. Denitrification rates of 37% were achieved for a limited period. A draft, up-scaled leachate treatment plant is presented, based on treatment performance of the trial plant.

Comparison of a reduced carbohydrate and reduced fat diet for LDL, HDL, and VLDL subclasses during 9-months of weight maintenance subsequent to weight loss.

OBJECTIVES: This study compared LDL, HDL, and VLDL subclasses in overweight or obese adults consuming either a reduced carbohydrate (RC) or reduced fat (RF) weight maintenance diet for 9 months following significant weight loss. METHODS: Thirty-five (21 RC; 14 RF) overweight or obese middle-aged adults completed a 1-year weight management clinic. Participants met weekly for the first six months and bi-weekly thereafter. Meetings included instruction for diet, physical activity, and behavior change related to weight management. Additionally, participants followed a liquid very low-energy diet of approximately 2092 kJ per day for the first three months of the study. Subsequently, participants followed a dietary plan for nine months that targeted a reduced percentage of carbohydrate (approximately 20%) or fat (approximately 30%) intake and an energy intake level calculated to maintain weight loss. Lipid subclasses using NMR spectroscopy were analyzed prior to weight loss and at multiple intervals during weight maintenance. RESULTS: Body weight change was not significantly different within or between groups during weight maintenance (p>0.05). The RC group showed significant increases in mean LDL size, large LDL, total HDL, large and small HDL, mean VLDL size, and large VLDL during weight maintenance while the RF group showed increases in total HDL, large and small HDL, total VLDL, and large, medium, and small VLDL (p<0.05). Group*time interactions were significant for large and medium VLDL (p>0.05). CONCLUSION: Some individual lipid subclasses improved in both dietary groups. Large and medium VLDL subclasses increased to a greater extent across weight maintenance in the RF group.

c-Myc is required for maintenance of glioma cancer stem cells.

BACKGROUND: Malignant gliomas rank among the most lethal cancers. Gliomas display a striking cellular heterogeneity with a hierarchy of differentiation states. Recent studies support the existence of cancer stem cells in gliomas that are functionally defined by their capacity for extensive self-renewal and formation of secondary tumors that phenocopy the original tumors. As the c-Myc oncoprotein has recognized roles in normal stem cell biology, we hypothesized that c-Myc may contribute to cancer stem cell biology as these cells share characteristics with normal stem cells. METHODOLOGY/PRINCIPAL FINDINGS: Based on previous methods that we and others have employed, tumor cell populations were enriched or depleted for cancer stem cells using the stem cell marker CD133 (Prominin-1). We characterized c-Myc expression in matched tumor cell populations using real time PCR, immunoblotting, immunofluorescence and flow cytometry. Here we report that c-Myc is highly expressed in glioma cancer stem cells relative to non-stem glioma cells. To interrogate the significance of c-Myc expression in glioma cancer stem cells, we targeted its expression using lentivirally transduced short hairpin RNA (shRNA). Knockdown of c-Myc in glioma cancer stem cells reduced proliferation with concomitant cell cycle arrest in the G(0)/G(1) phase and increased apoptosis. Non-stem glioma cells displayed limited dependence on c-Myc expression for survival and proliferation. Further, glioma cancer stem cells with decreased c-Myc levels failed to form neurospheres in vitro or tumors when xenotransplanted into the brains of immunocompromised mice. CONCLUSIONS/SIGNIFICANCE: These findings support a central role of c-Myc in regulating proliferation and survival of glioma cancer stem cells. Targeting core stem cell pathways may offer improved therapeutic approaches for advanced cancers.

Death on a road (Dem. 23.53)

Scholarly consensus holds that a law quoted in Demosthenes (23.53) permitted one to kill a highway robber who had lain in ambush and attacked one on a road. But the relevant phrase says nothing explicit about ambush. Modern interpretation derives from Harpocration and other ancient authorities. It is argued here that they were mistaken and that the phrase referred to those who inadvertently killed a fellow traveler while overtaking on a road.' The new interpretation may offer another way to think about the encounter between Oedipus and Laius.