We developed a new method of transforming Japanese case particles when transforming Japanese passive sentences into active sentences. This method separates training data into each input particle and uses machine learning for each particle. We also used numerous rich features for learning. Murata et al. conducted a previous study on transforming Japanese passive sentences into active sentences . They used machine learning but did not separate training data for any input particles and did not have many rich features for learning. They achieved an accuracy rate of 89.77%. We added many rich features to those used in Murata et al.'s study and obtained an accuracy rate of 92.00%. In addition, we used our method of separating training data into each input particle and using machine learning for each particle, and obtained an accuracy rate of 94.30%. We confirmed the significance of these improvements through a statistical test. We also conducted experiments utilizing traditional methods using verb dictionaries and manually prepared heuristic rules and confirmed that our method achieved much higher accuracy rates than traditional methods.
In this paper, we introduce a nonstandard analysis into a logical modeling of continuous dynamics and present a new framework called hyper-finite hybrid automaton (HHA). HHA is a nonstandard interpretation of hybrid automata in the domain of *R. We also enlarge the linear temporal logic LTL to *LTL to describe the system specification. In this framework, we examine the validation of the system consistency of the hybrid system based on model checking, especially the existence and reachability of Zeno point.
Along with the trend towards low cost, high performance computer systems and the widespread availability of the Internet, Peer to Peer (P2P) technology is receiving increased attention. One aspect of P2P, decentralized storage utilizing optimistic concurrency control, suffers from a number of problems such as the detection of collisions and the resolution of conflicts. Solutions to date have been application-specific. This paper proposes a new data management structure dubbed WOODS (Write Once Oriented Data management Structure) which does not require conflict resolution for applications such as email, where only read and append access in required and where the order of concurrent updates is not crucial. The paper applies WOODS to a mailing list system, demonstrating that inter-application synchronization is not required for concurrent updates and that it can be used even when the network is partitioned and later reintegrated.
A design problem of DFC (delayed feedback control) satisfying H∞ performance specification is considered for sampled-data systems. It is shown that stabilization of UPOs (unstable periodic orbits) can be cast into an H∞ control synthesis with an unstable weight. The nonstandard synthesis problem is then reduced to a standard one under mild condition, which also concludes that the DFC structure is necessary for the stabilization of UPOs. A synthesis problem is formulated by putting extra sampled-data H∞ specifications to the problem related to the stabilization of UPOs, and the properties including the order of the resultant controller are discussed. The validity of the proposed method is confirmed by numerical examples.