Using Web-based content management systems such as Blog, an end user can easily publish User Generated Content (UGC). Although publishing of UGCs is easy, controlling access to them is a difficult problem for end users. Currently, most of Blog sites offer no access control mechanism, and even when it is available to users, it is not sufficient to control users who do not have an account at the site, not to mention that it cannot control accesses to content hosted by other UGC sites. In this paper, we propose new access control architecture for UGC, in which third party entities can offer access control mechanism to users independently of UGC hosting sites. With this architecture, a user can control accesses to his content that might be spread over many different UGC sites, regardless of whether those sites have access control mechanism or not. The key idea to separate access control mechanism from UGC sites is to apply cryptographic access control and we implemented the idea in such a way that it requires no modification to UGC sites and Web browsers. Our prototype implementation shows that the proposed access control architecture can be easily deployed in the current Web-based communication environment and it works quite well with popular Blog sites.

This paper presents a novel data transmission protocol "SVFTP," which enables high-speed and error-free video data transmission over IP networks. A video transmission system based on SVFTP is also presented. While conventional protocols are designed for file transmission, SVFTP focuses on video data as a continuous media. In order to fit a flexible video transmission system, SVFTP achieves higher throughput on the long distance link as well as transmission interruption/resumption and progressive download and play back. In addition, a rate shaping mechanism for SVFTP is introduced in order to control greediness and burst traffic of multiple-TCP sessions. Laboratory and field transmission experiments show that SVFTP achieves high performance and functionality.

Call tracking data contains a calling address, called address, service type, and other useful attributes to predict a customer's calling activity. Call tracking data is becoming a target of data mining for telecommunication carriers. Conventional data-mining programs control the number of association rules found with two types of thresholds (minimum confidence and minimum support), however, often they generate too many association rules because of the wide variety of patterns found in call tracking data. This paper proposes a new method to reduce the number of generated rules. The method proposed tests each generated rule based on Akaike Information Criteria (AIC) without using conventional thresholds. Experiments with artificial call tracking data show the high performance of the proposed method.

The differential cryptanalysis method developed by E. Biham et al. presented a new index of cryptographic strength, i.e. signal to noise ratio (S/N). Their paper estimates S/N only for DES-like functions, i.e., cryptographic function based on iterating the same weak function n times. Other types such as including both stronger and weaker functions have not yet been examined. This paper examines the N-stage MULTI2 cipher algorithm to calculate S/N and shows there are many fast cipher algorithms having small S/N property.

The parsing method which analyzes sentences into trees may be divided into two categories, the procedural method and the filtering method. The former composes a tree avoiding the occurrence of improper analysis in the course of the analysis procedure by strictly defining the order of application of transformation rules concerning tree structure. The latter obtains the proper tree by obtaining, first, many analysis results through unlimited application of existing rewriting rules and by, later, eliminating improper trees with a filter. The former includes the parsers in the ARIANE 78 at Grenoble University and also at the group led by Kyoto University. This paper proposes a parsing method using the above-mentioned filtering scheme. The method is based on extended LINGOL which is included in the latter category and uses forbidden trees and exclusive trees which respectively forbid and foster the sentence pattern contained in these trees. These trees, cooperating together, work to filter out spurious results. The paper also treats OR nodes for expression of multiple trees in a single tree, giving an algebraic means to allow coexistence of OR nodes and the above-mentioned forbidden and exclusive trees. The algorithm presented in this paper has proved to act well in practical computer experiment showing that it is extensible for practical use.

This paper describes an effective method for coping with short-line-interruptions in high-speed data transmission, and effectiveness of the technique is shown by the experiments.

Since Vendler classified aspect into four categories, state, achievement, activity, and accomplishment, much effort has been made to define the notion of aspect logically. It is commonly agreed that aspect represents the general temporal characteristics of events and states. However, there still remains a considerable amount of disagreement about its formal treatment. One of the major problems is that the aspect of a sentence shifts by certain types of sentence construction. For instance, adding time adverbials to a sentence modifies the original aspect, taking the progressive form of the verb changes the aspect, and so on. These phenomena are known as the aspect shifts. The other is the problem known as the imperfective paradox. The imperfective paradox is a problem of the truth definition of the progressives. The truth condition of the progressive form of the sentence is defined at an internal subinterval of the temporal range of the corresponding non-progressive sentence. If the truth condition of the progressive form of the sentence is defined using the truth condition of the non-progressive form of the sentence, there are logical contradictions of truth definition in a sentence such as "Max was building a house, but he never built it". These problems cause much confusion (1) in the truth definition of aspects, (2) in the definition of aspect operations, such as initiative, terminative, progressive, perfective, etc., and also (3) in the definition of adding time adverbials. This paper reviews the semantic problems with respect to aspect, and presents a consistent mechanism of aspect interpretation in order to settle all these semantic puzzles at once. For the sake of logical clarity, we construct a formal language, Lt, where every meaningful formula is a pair of a meaningful sentence and its aspect. The syntax of Lt describes the phenomenology of aspect shifts. The semantics of Lt defines temporal interpretation for all the meaningful sentences of Lt, with assuming the temporal interpretations of three inherent aspects, state, achievement, and activity. The proposed aspect interpretation gives a reasonable account for aspect shifts, and solves the imperfective paradox by asssuming the time structure to be backwards linear.

This paper introduces a probabilistic modeling of alarm observation delay, and shows a novel method of model-based diagnosis for time series observation. First, a fault model is defined by associating an event tree rooted by each fault hypothesis with probabilistic variables representing temporal delay. The most probable hypothesis is obtained by selecting one whose Akaike information criterion (AIC) is minimal. It is proved by simulation that the AIC-based hypothesis selection achieves a high precision in diagnosis.