Recently, dynamic access control models are proposed to restrict access domain appropriately in multi-layered defense. However, policy description languages proposed so far can not express the models effectively in proper granularity. In this paper, we propose a policy description language which can designate precise condition for access control by using dynamic status of application process. Using the proposed language, we compose the policy of SELinux which is major implementation achieving multi-layered defense and confirm the advantages of the proposed language by evaluating the response and the expressiveness.

In case of modern IA32 processors, full virtualization virtual machine monitor (VMM) software implementation not using hardware assistance (i.e. IntelVT) like a VMware can be detected by measuring some instructions execution clock, which is available by reading the time stamp counter (TSC). When using the appliance systems on the generic real hardware based on IA32 processor, the developer of the appliance systems don't think to run these systems on the virtual machine (VM). VMM existence under the operating system (OS) can be detected from the user programs. But if possible, detecting VMM in the system bootstrap phase is more suitable for the system like the appliance systems. In this paper, we propose VM detection in the system bootstrap.

In case of modern IA32 processors, full virtualization virtual machine monitor (VMM) like a VMware can be detected by measuring some instructions execution time with the time stamp counter (TSC).But when detecting VMM, error analysis for execution times or choosing TSC read point is important for reducing misjudgement whether detecting result is virtual machine (VM) or not. In this paper, we propose the VM detection point and detection program running mode for reducing VM misjudgement.

Although aspect-oriented software development is regarded as a suitable way to build non-functional requirements such as security concerns, there are few researches for identifying security aspects in early development stages. This paper presents an approach for identifying security aspects and pointcuts in a requirement analysis stage with extending misuse cases.

It is difficult to apply existing software development methods to security concerns. Using software for security testing purposes, in particular, is hard to do. The fact that there is a restriction on the implementation of software affects the ease with which security can be tested. In this paper we propose a decision process of coding conventions for security, mindful of testing security. Then, we apply our method to preventing injection attacks on Web application programs, and establish some coding conventions that can be used against injection attacks and cross site scripting. We also discuss security frameworks, which are also useful as conventions

We are developing a cooking navigation system, which helps even a novice user to cook several recipes in parallel without failure, while improving an advanced user's skill further. To realize this, the system optimizes the cooking procedure considering the following restrictions: (1) Duration of cooking, (2) Accuracy of cooking, and (3) Learning effect, by providing appropriate instructions to user's at the right timing, making full use of multimedia information. The users should be able to cook perfectly and comfortably just by following the text, video and audio provided by the system. According to the result of a preliminary experiment, all users from novice to experienced cooks could finish two dishes in parallel while enjoyeing the cooking very much. The result of a questionnaire shows the effectiveness of the multimedia navigation that we propose.

We propose a novel object detection and tracking method in order to detect and track objects necessary to describe contents of a soccer game. On the contrary to intensity oriented conventional object detection methods, the proposed method refers to color rarity and local edge property, and integrally evaluates them by a fuzzy function to achieve better detection quality. These image features were chosen considering the characteristics of soccer video images, that most non-object regions are roughly single colored (green) and most objects tend to have locally strong edges. We also propose a simple object tracking method, that could track objects with occlusion with other objects using a color based template matching. The result of an evaluation experiment applied to actual soccer video showed very high detection rate in detecting player regions without occlusion, and promising ability for regions with occlusion.

Article Free Access Share on Associating video with related documents Authors: Reiko Hamada Graduate School of Electrical Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan Graduate School of Electrical Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, JapanView Profile , Ichiro Ide Graduate School of Electrical Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan Graduate School of Electrical Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, JapanView Profile , Shuichi Sakai Graduate School of Electrical Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan Graduate School of Electrical Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, JapanView Profile , Hidehiko Tanaka Graduate School of Electrical Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan Graduate School of Electrical Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, JapanView Profile Authors Info & Claims MULTIMEDIA '99: Proceedings of the seventh ACM international conference on Multimedia (Part 2)October 1999Pages 17–20https://doi.org/10.1145/319878.319883Published:01 October 1999Publication History 1citation199DownloadsMetricsTotal Citations1Total Downloads199Last 12 Months11Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Article Teddy: a sketching interface for 3D freeform design Share on Authors: Takeo Igarashi University of Tokyo University of TokyoView Profile , Satoshi Matsuoka Tokyo Institute of Technology Tokyo Institute of TechnologyView Profile , Hidehiko Tanaka University of Tokyo University of TokyoView Profile Authors Info & Claims SIGGRAPH '99: Proceedings of the 26th annual conference on Computer graphics and interactive techniquesJuly 1999 Pages 409–416https://doi.org/10.1145/311535.311602Published:01 July 1999 830citation3,369DownloadsMetricsTotal Citations830Total Downloads3,369Last 12 Months47Last 6 weeks13 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Diagram manipulation in conventional CAD systems requires frequent mode switching and explicit placement of the pivot for rotation and scaling. In order to simplify this process, we propose an interaction technique called integrated manipulation, where the user can move, rotate, and scale without mode switching. In addition, the pivot for rotation and scaling automatically snaps to a contact point during moving operation. We performed a user study is performed using our prototype system and a commercial CAD system. The results showed that users could perform a diagram manipulation task much more rapidly using our technique.

No abstract available.

We propose interactive beautification, a technique for rapid geometric design, and introduce the technique and its algorithm with a prototype system Pegasus.The motivation is to solve a problem with current drawing systems: too many complex commands and unintuitiveprocedures to satisfy geometric constraints.The Interactive beautification system receives the user'sfree stroke and beautifies it by considering geometric constraints among segments.A single stroke is beautified one after another, preventing accumulation of recognition errors or catastrophic deformation.Supported geometric constraints include perpendicularity, congruence, symmetry, etc., which were not seen in existing free stroke recognition systems.In addition, the system generates multiple candidates as a result of beautification to solve the problem of ambiguity.Using this technique, the user can draw precise diagrams rapidly satisfying geometric relations without using any editing commands.Interactive beautification is achieved by three sequential processes: 1) inferring underlining geometric constraints based on the spatial relationships among the input stroke and the existing segments, 2) generating multiple candidates by combining inferred constraints appropriately, and 3) evaluating the candidates to find the most plausible candidate and to remove the inappropriate candidates.A user study was performed using the prototypesystem, a commercial CAD tppl, and an OObased drawing system.The result showed that users can draw required diagrams more rapidly and moreprecisely using the prototype system.

Multi-threading is often used to compile logic and functional languages, and implement parallel C libraries. Fine-grain multi-threading requires rapid context switching, which can be slow on architectures with register windows. In past, researchers have either proposed new hardware support for dynamic allocation of windows to threads, or have sacrificed fast procedure calls by fixed allocation of windows to threads.

Concurrency-control scheduling of batch transactions on shared-nothing (or loosely-coupled) multiprocessor database machines is discussed. Various schedulers are tested for these batch transactions to examine how well they perform when both intertransaction parallelism and intratransaction parallelism are limited. New schedulers designed for batch transaction processing are outlined which use a new tool called a weighted transaction-precedence graph (WTPG). Simulation results show that two new schedulers (globally and locally optimized WTPG schedulers) are the best performers under various workloads.>

A practical design assistance system at the register transfer level is proposed. The unique characteristic of this system is that users are allowed to modify a register-level design manually. At first, the designer gives an initial behavioral description and an initial structure of a data path to be designed. The initial structure is formed through the designers' intuition. The final design is obtained by modifying the initial design manually. Consistency between the data path and its behavioral specification is verified automatically. The verifier was implemented and applied to an ASIC chip design.>

New concurrency control schemes are proposed for bulk access transactions (BATs) on shared-nothing database machines. A BAT is a transaction accessing a large bulk of data, such as a transaction updating a whole file. BATs are used for batch jobs in database services, and many BATs should be finished in a short time. Thus it is necessary to execute BATs concurrently on a database machine. When scheduling BATs, the performance is degraded by very high contention of both data and resources. Therefore, the strategy for scheduling BATs is to reduce the contention as much as possible. A weighted transaction precedence graph (WTPG) and two schedulers using it are proposed. A WTPG is used to estimate the degree of contention in a serializable schedule. Using a WTPG, the proposed schedulers reduced the contention by optimization. In the simulation, both schedulers achieve from 1.2 to 1.8 times higher throughput than atomic static lock and two-phase lock.>

Article Free Access Share on Algorithm and performance evaluation of adaptive multidimensional clustering technique Authors: Shinya Fushimi Department of Electrical Engineering, University of Tokyo Department of Electrical Engineering, University of TokyoView Profile , Masaru Kitsuregawa Institute of Industrial Science, University of Tokyo Institute of Industrial Science, University of TokyoView Profile , Masaya Nakayama Department of Electrical Engineering, University of Tokyo Department of Electrical Engineering, University of TokyoView Profile , Hidehiko Tanaka Department of Electrical Engineering, University of Tokyo Department of Electrical Engineering, University of TokyoView Profile , Tohru Moto-oka Department of Electrical Engineering, University of Tokyo Department of Electrical Engineering, University of TokyoView Profile Authors Info & Claims SIGMOD '85: Proceedings of the 1985 ACM SIGMOD international conference on Management of dataMay 1985Pages 308–318https://doi.org/10.1145/318898.318928Published:01 May 1985Publication History 8citation361DownloadsMetricsTotal Citations8Total Downloads361Last 12 Months14Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF