Based on the automation status and the main problem of container terminals, this paper introduced a new type of three--dimensional orbital automated handling system,which had high efficiency,energy saving and low cost operation. The three--dimensional orbital automated terminal was compared with the existing terminals in handling efficiency and operating energy consumption by using simulation method. The results show that the new terminal has obvious advantages both in handling efficiency and energy saving.

Submarine rescue is a necessary and complicate project with many uncertainties. To evaluate and validate rescue scheme, a simulation system of deep submarine rescue was developed based on virtual reality. In the system, an initial schedule was obtained by applying discrete scheduling approach, physical behaviors of entities were reflected by human factors analysis, dynamics and hydrodynamics calculation, the initial rescue scheme was validated and improved by human-computer interaction. Data inputting, scene modeling and scene driving were established, and key technologies of the system were described detailedly. The simulation system supplies necessary theory basis and direct visual expression for submarine rescue.

A carbon powder inlet and a graphite powder collecting are oppositely arrange on a furnace body. At least a pair of electrodes are oppositely arranged in the furnace body with respect to a graphitizing area at an intermediate position between the inlet and the collecting port and are engaged with different timing.

To solve resource leveling problem in emergency scheduling,a heuristic algorithm was developed.Firstly,an initial critical chain was defined without considering resource constraints.Then,according to the earliest and latest start time of tasks in the initial critical chain,several urgency-based heuristic rules were proposed to solve resource conflicts.Finally,combing the initial critical chain and heuristic rules,an urgency-based heuristic algorithm was developed.The objective of the algorithm was to obtain the lowest resource configuration and corresponding scheduling within settled project duration.The experiment results showed that the proposed heuristic algorithm could obtain better results by comparing to the existing algorithms,and was more applicable to emergency scheduling problems.

Online advertising represents a growing part of the revenues of major Internet service providers such as Google and Yahoo. A commonly used strategy is to place advertisements (ads) on the search result pages according to the users' submitted queries. Relevant ads are likely to be clicked by a user and to increase the revenues of both advertisers and publishers. However, bid phrases defined by ad-owners are usually contained in limited number of ads. Directly matching user queries with bid phrases often results in finding few appropriate ads. To address this shortcoming, query expansion is often used to increase the chances to match the ads. Nevertheless, query expansion on top of the traditional inverted index faces efficiency issues such as high time complexity and heavy I/O costs. Moreover, precision cannot always be improved, sometimes even hurt due to the involvement of additional noise. In this paper, we propose an efficient ad search solution relying on a block-based index able to tackle the issues associated with query expansion. Our index structure places clusters of similar bid phrases in corresponding blocks with their associated ads. It reduces the number of merge operations significantly during query expansion and allows sequential scans rather than random accesses, saving I/O costs. We adopt flexible block sizes according to the clustering results of bid phrases to further optimize the index structure for efficient ad search. The pre-computation of such clusters is achieved through an agglomerative iterative clustering algorithm. Finally, we adapt the spreading activation mechanism to return the top-k relevant ads, improving search precision. The experimental results of our prototype, AdSearch, show that we can indeed return a larger number of relevant ads without sacrificing execution speed.

Maritime disaster can cause loss of human life and economy, as well as environment damage. Also the disaster rescue is difficult for the complexity of rescue process. Disaster rescue is emergent and urgent most of the time; therefore, quick response is rather important. The existing knowledge always supplies some strategies and generates a rescue plan by human expertise manual decision-making. The rescue plan obtained manually may be not a good one due to the lack of time available for human decision-makers to make decisions. To overcome limited time pressure, while retaining minimum rescue project duration, a rescue plan for the maritime disaster rescue is obtained with the application of heuristic resource-constrained project scheduling approach in this paper. Meanwhile a heuristic algorithm is proposed to generate the minimum project duration and the activities start times. To study its performance, 20 maritime rescue examples (21–50 activities) were tested. By comparing with those generated by the manual decision-making method, the results generated by heuristic algorithm indicate high efficiency. It also identifies the critical chain of the rescue project, which can help decision-makers control the rescue process efficiently.

Nowadays, the demand on querying and searching the Semantic Web is increasing. Some systems have adopted IR (Information Retrieval) approaches to index and search the Semantic Web data due to its capability to handle the Web-scale data and efficiency on query answering. Additionally, the huge volumes of data on the Semantic Web are frequently updated. Thus, it further requires effective update mechanisms for these systems to handle the data change. However, the existing update approaches only focus on document. It still remains a big challenge to update IR index specially designed for semantic data in the form of finer grained structured objects rather than unstructured documents. In this paper, we present a well-designed update mechanism on the IR index for triples. Our approach provides a flexible and effective update mechanism by dividing the index into blocks. It reduces the number of update operations during the insertion of triples. At the same time, it preserves the efficiency on query processing and the capability to handle large scale semantic data. Experimental results show that the index update time is a fraction of that by complete reconstruction w.r.t. the portion of the inserted triples. Moreover, the query response time is not notably affected. Thus, it is capable to make newly arrived semantic data immediately searchable for users.

Since many mixed model assembly lines are manual assembly,the improvement of a mixed model assembly line was studied.A clinker-built building block tower model with box restriction was developed based on the existing building block model,and a new building rule was derived.Based on this rule,a kind of workstation-constrained heuristic algorithm was complied to improve existing mixed model assembly lines.One subsection optimization strategy was advanced to split big scale problem to be small ones,and this strategy quickens the execution of algorithm.The validity and applicability of workstation-(constrained) heuristic algorithm was validated by the analysis of example.

A large number of exact algorithm and heuristics have been proposed to balancing traditional one-sided assembly line,while little attention has been paid to balancing the two-sided assembly lines.In this study,the characteristics of two-sided assembly line balancing were analyzed and studied,the mathematical model was built,and then an efficient heuristic algorithm was developed. In the proposed method,a position-based task assignment procedure was adopted;several heuristic rules,including tasks that have operation direction constraint first,were studied and so on.Experiments were carried out to demonstrate the performance of the proposed method.The results show that this procedure is promising in the solution quality.

In view of the task completion delay caused by various disturbances in an actual assembly line,the unbalanced problem was reduced to dynamic response area.And based on the essential principle of local search algorithm and reading rule of array,an improved nested search algorithm was compiled.In the case of single dynamic worker and several dynamic workers,different response strategies were established,respectively.It was concluded that the strategy that several dynamic workers serve the whole assembly line corporately is better than the respective serving strategy.The strategy's effectiveness was validated by the analysis of example.