Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Naohiko Uramoto

dblp:19/2638 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2Security and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 50% Information extraction and text analysis · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
discourse representation
0.011995
Discourse as a Knowledge Resource for Sentence Disambiguation · IJCAI 1995
Natural language and speech › Information extraction and text analysis › ambiguity resolution
sentence disambiguation
0.011995
Discourse as a Knowledge Resource for Sentence Disambiguation · IJCAI 1995

Methods — techniques the papers use, named apart from their topics

discourse analysis · 0.0
YearPublicationVenuePosition
2013 ICHIGAN Security - A Security Architecture That Enables Situation-Based Policy Switching
abstract
Project ICHIGAN is a voluntary-based attempt to build a reference IT architecture for local governments that can withstand large-scale natural disasters. This architecture is unique in that 1) it has the concept of {em phases} of the situation for which different priorities on non-functional requirements are applied, and 2) the functionalities and services provided by the IT systems in the suffered area will be taken over by those of the ``coupled'' local government. These features pose specific challenges on the information security policy, especially because different policies need to be applied for the different modes. This paper describes two key elements to enable the policy, policy templates and deferred authentication.
Hiroshi Maruyama, Kiyoshi Watanabe, Sachiko Yoshihama, Naohiko Uramoto, Yoichiro Takehora, Kazuhiro Minami
ARES4
2009 Static vs. Dynamic Validation of BSP Conformance
abstract
WS-I's basic security profile (BSP) defines best practice guidelines for secure Web services communications, enabling interoperability between vendors. However it is difficult for developers to know if their SOA solutions are in fact compliant to these guidelines. In this paper, we discuss methods to assess compliance against BSP. We have implemented runtime validation of SOAP messages to check for compliance against BSP, a method implied by the BSP definition itself. Additionally, we have implemented a novel approach to statically validate WS security policies against BSP using Schematron. From our experiments dynamic validation for BSP compliance offers greater coverage but results in a significant overhead, while static validation is limited in its scope but extremely valuable since under reasonable assumptions it provides assurances about compliance prior to deployment. We conclude with a summation of our results and lessons for SOA practitioners.
Stefan Prennschütz-Schützenau, Nirmal Mukhi, Satoshi Hada, Naoto Sato, Fumiko Satoh, Naohiko Uramoto
ICWS6
2007 Easy-To-Use Programming Model for Web Services Security
abstract
Even with a support tool, setting up a Web services security (WS-Security) configuration can be difficult for people who are not familiar with WS-Security. Some of the reasons are that the WS-Security is a very rich specification with many options and often the processing is complicated. This paper introduces an application programming model (WSSAPI) to simplify the programming experience for end users. It was designed by looking at WS-Security processing from an abstract level. Also, it is designed to consider correctness, efficiency, usability, flexibility, portability, and extensibility. End users just follow the six-step programming model provided in WSSAPI to configure WS-Security. The comparison of WSSAPI to others, like WSS4J, WSE, and JSR-105 shows that it is much easier for end users to use WSSAPI. In this paper, existing APIs for WS-Security are reviewed and compared with WSSAPI to evaluate the ease of use and utility.
Yumi Yamaguchi, Hyen-Vui Chung, Masayoshi Teraguchi, Naohiko Uramoto
APSCC4
2006 Optimizing Differential XML Processing by Leveraging Schema and Statistics
Toyotaro Suzumura, Satoshi Makino, Naohiko Uramoto
ICSOC3
1996 Positioning Unknown Words in a Thesaurus by Using Information Extracted from a Corpus
Naohiko Uramoto
COLING1
1995 Discourse as a Knowledge Resource for Sentence Disambiguation
Tetsuya Nasukawa, Naohiko Uramoto
IJCAI2
1994 A Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation
Naohiko Uramoto
COLING1
1992 Shalt2 - a Symmetric Machine Translation System with Conceptual Transfer
Koichi Takeda 0002, Naohiko Uramoto, Tetsuya Nasukawa, Taijiro Tsutsumi
COLING2