Effect of ethanol on toxicity and metabolism of amphetamine in the mouse.

Ethanol, 3 g/kg i.p., did not significantly alter the acute toxicity of amphetamine in the mouse. However, the urinary metabolite pattern was changed, suggesting that ethanol suppressed metabolism of the stimulant during the initial 6 h period. After 24 h, the mouse metabolized the same fraction of a given dose of amphetamine, whether it was given as amphetamine alone or amphetamine mixed with 2,3 or 4 g/kg ethanol.     

Automatic patent document summarization for collaborative knowledge systems and services

Engineering and research teams often develop new products and technologies by referring to inventions described in patent databases. Efficient patent analysis builds R&D knowledge, reduces new product development time, increases market success, and reduces potential patent infringement. Thus, it is beneficial to automatically and systematically extract information from patent documents in order to improve knowledge sharing and collaboration among R&D team members. In this research, patents are summarized using a combined ontology based and TF-IDF concept clustering approach. The ontology captures the general knowledge and core meaning of patents in a given domain. Then, the proposed methodology extracts, clusters, and integrates the content of a patent to derive a summary and a cluster tree diagram of key terms. Patents from the International Patent Classification (IPC) codes B25C, B25D, B25F (categories for power hand tools) and B24B, C09G and H011 (categories for chemical mechanical polishing) are used as case studies to evaluate the compression ratio, retention ratio, and classification accuracy of the summarization results. The evaluation uses statistics to represent the summary generation and its compression ratio, the ontology based keyword extraction retention ratio, and the summary classification accuracy. The results show that the ontology based approach yields about the same compression ratio as previous non-ontology based research but yields on average an 11% improvement for the retention ratio and a 14% improvement for classification accuracy.     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

Analysis of discrete-time queues with batch renewal input and multiple vacations

This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed.Service and vacation times are mutually independent and geometrically distributed.The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch.The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system.Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival,arbitrary and outside observer’s observation epochs for partial-batch rejection policy.The blocking probability of the first-,an arbitrary-and the last-job in a batch have been discussed.The analysis of actual waiting-time distributions measured in slots of the first-,an arbitrary- and the last-job in an accepted batch,and other performance measures along with some numerical results have also been investigated.     

Suggestions for New Application Areas for Soft Systems Methodology in the Information Age

Soft systems methodology (SSM) is now 40?years old. Another decade has passed since Checkland??s thirty year retrospective on the methodology, published in 2000. It can now be described as an old methodology. But it has adapted and changed over the years and is still very much alive, although the days are long gone when it was mainly developed and practised by its founders at the University of Lancaster. Interestingly, considering that many applications of SSM over the years have been to information systems, it was developed before the age of personal computers and the Internet. The way SSM is viewed has changed over the years as it has been applied to various types of problem situation. Every use of SSM will potentially hold methodological lessons in addition to those about the situation of concern; these may include SSMs framework of ideas, processes and way of use. How is SSM going to change in the future? This will depend in part on the types of problem situation to which it is applied. This paper examines some problem situations associated with emerging technologies in the information age to which SSM has not yet been much applied. These include computer simulation and virtual reality, ubiquitous computing and the design of cities, Information Technology Service Management and the design of enterprise information architectures. Some of the different worldviews associated with these problem situations which could be explored using SSM are noted.     

An equivalency condition of nonsingularity in nonlinear semidefinite programming

<正> In this paper,an equivalency condition of nonsingularity in nonlinear semidefinite programming,which can be viewed as a generalization of the equivalency condition of nonsingularity for linearsemidefinite programming,is established under certain conditions of convexity.     

Clustering patents using non-exhaustive overlaps

Patent documents are unique external sources of information that reveal the core technology underlying new inventions.Patents also serve as a strategic data source that can be mined to discover state-of-the-art technical development and subsequently help guide R&D investments.This research incorporates an ontology schema to extract and represent patent concepts.A clustering algorithm with non-exhaustive overlaps is proposed to overcome deficiencies with exhaustive clustering methods used in patent mining and technology discovery.The non-exhaustive clustering approach allows for the clustering of patent documents with overlapping technical findings and claims,a feature that enables the grouping of patents that define related key innovations.Legal advisors can use this approach to study potential cases of patent infringement or devise strategies to avoid litigation.The case study demonstrates the use of non-exhaustive overlaps algorithm by clustering US and Japan radio frequency identification (RFID) patents and by analyzing the legal implications of automated discovery of patent infringement.