Rutkowski A.,Yaana Technologies |
Kadobayashi Y.,NAIST |
Furey I.,DHS Inc |
Rajnovic D.,FIRST |
And 2 more authors.
SIGCOMM'10 - Proceedings of the SIGCOMM 2010 Conference | Year: 2010
The cybersecurity information exchange framework, known as CYBEX, is currently undergoing its first iteration of standardization efforts within ITU-T. The framework describes how cybersecurity information is exchanged between cybersecurity entities on a global scale and how the exchange is assured. The worldwide implementation of the framework will eventually minimize the disparate availability of cybersecurity information. This paper provides a specification overview, use cases, and the current status of CYBEX.
Yamamoto S.-I.,Ryukoku University |
Uraoka Y.,NAIST |
Taguchi N.,Image Technology Incorporated |
Nonaka T.,Ryukoku University
Methods and Applications in Fluorescence | Year: 2013
We deposited comb electrodes with narrow gaps between the teeth on a glass substrate, thus realizing a high electric field intensity that cannot be achieved with conventional structures. Au electrodes are deposited to form a comb shape and then spin-coated with a phosphor layer obtained by mixing ZnS phosphor particles with resins in a certain ratio. An AC voltage was applied to the gaps between the teeth of the comb electrode to emit light, from which the luminance was measured for different electric field intensities. The luminance was not affected by the transmittance of the electrodes themselves when measured from the phosphor layer side. Therefore, it may be possible to produce a display that does not require transparent electrodes by using the phosphor layer side of a device with comb electrodes made of metals, such as Au, for the display. © 2013 IOP Publishing Ltd.
Ikenaga E.,Japan Synchrotron Radiation Research Institute |
Kobata M.,NIMS Beamline Station |
Matsuda H.,NAIST |
Sugiyama T.,Japan Synchrotron Radiation Research Institute |
And 2 more authors.
Journal of Electron Spectroscopy and Related Phenomena | Year: 2013
In this study, we have realized a high lateral resolution and wide-angle-resolved hard X-ray photoelectron spectroscopy (HAXPES) facility at BL47XU in SPring-8. The system uses Kirkpatrick-Baez focusing mirrors to achieve a beam size of 1.0 μm (horizontal) × 0.98 μm (vertical) at the photon energy of 7.94 keV and a wide-acceptance-angle objective lens installed in front of the electron energy analyzer. The objective lens system, which we had been developed originally and has achieved a total acceptance angle of ±34 with a resolution better than that of an acceptance angle of 1.5. The performance of this system was evaluated through core spectra measurements of a typical multi-layered sample of Ir (8 nm)/HfO2 (2.2 nm)/thickness-graded SiO2 (0-10 nm)/Si(0 0 1). © 2013 Elsevier B.V. All rights reserved.
Kawana Y.,Nara Institute of Science and Technology |
Ukita N.,NAIST |
Proceedings of the 14th IAPR International Conference on Machine Vision Applications, MVA 2015 | Year: 2015
In this paper we examine efficacy of occlusion-free appearance learning for part based model. Appearance modeling with less accurate appearance data is problematic because it adversely affects entire learning process. We evaluate the effectiveness of excluding occluded body parts to be modeled for better appearance modeling process. To meet this end, We employ a simple but effective occlusion detection method. We present our approach contributes to improve the performance of human pose estimation. © 2015 MVA organization.
Takahashi H.,Osaka University |
Takahashi H.,Tamagawa University |
Terada K.,Gifu University |
Morita T.,Osaka University |
And 10 more authors.
Cortex | Year: 2014
Internal (neuronal) representations in the brain are modified by our experiences, and this phenomenon is not unique to sensory and motor systems. Here, we show that different impressions obtained through social interaction with a variety of agents uniquely modulate activity of dorsal and ventral pathways of the brain network that mediates human social behavior. We scanned brain activity with functional magnetic resonance imaging (fMRI) in 16 healthy volunteers when they performed a simple matching-pennies game with a human, human-like android, mechanical robot, interactive robot, and a computer. Before playing this game in the scanner, participants experienced social interactions with each opponent separately and scored their initial impressions using two questionnaires. We found that the participants perceived opponents in two mental dimensions: one represented "mind-holderness" in which participants attributed anthropomorphic impressions to some of the opponents that had mental functions, while the other dimension represented "mind-readerness" in which participants characterized opponents as intelligent. Interestingly, this "mind-readerness" dimension correlated to participants frequently changing their game tactic to prevent opponents from envisioning their strategy, and this was corroborated by increased entropy during the game. We also found that the two factors separately modulated activity in distinct social brain regions. Specifically, mind-holderness modulated activity in the dorsal aspect of the temporoparietal junction (TPJ) and medial prefrontal and posterior paracingulate cortices, while mind-readerness modulated activity in the ventral aspect of TPJ and the temporal pole. These results clearly demonstrate that activity in social brain networks is modulated through pre-scanning experiences of social interaction with a variety of agents. Furthermore, our findings elucidated the existence of two distinct functional networks in the social human brain. Social interaction with anthropomorphic or intelligent-looking agents may distinctly shape the internal representation of our social brain, which may in turn determine how we behave for various agents that we encounter in our society. © 2014 The Authors.
Wang S.,Xidian University |
Zhang Z.,Telecom Lille 1 |
Computers and Security | Year: 2013
The increasing complexity of today's computer systems, together with the rapid emergence of novel vulnerabilities, make security hardening a formidable challenge for security administrators. Although a large variety of tools and techniques are available for vulnerability analysis, the majority work at system or network level without explicit association with human and organizational factors. This article presents a middleware approach to bridge the gap between system-level vulnerabilities and organization-level security metrics, ultimately contributing to cost-benefit security hardening. In particular, our approach systematically integrates attack graph, a commonly used effective approach to representing and analyzing network vulnerabilities, and Hidden Markov Model (HMM) together, for exploring the probabilistic relation between system observations and states. More specifically, we modify and apply dependency attack graph to represent network assets and vulnerabilities (observations), which are then fed to HMM for estimating attack states, whereas their transitions are driven by a set of predefined cost factors associated with potential attacks and countermeasures. A heuristic searching algorithm is employed to automatically infer the optimal security hardening through cost-benefit analysis. We use a synthetic network scenario to illustrate our approach and evaluate its performance through a set of simulations. © 2012 Elsevier Ltd. All rights reserved.
Kula R.G.,NAIST |
Fushida K.,NTT Data |
Yoshida N.,NAIST |
Proceedings - Asia-Pacific Software Engineering Conference, APSEC | Year: 2012
During the software development lifecycle, studies have shown that over 75% of project costs originate from the maintenance phase. Analysis of the processes within the maintenance phase could prove beneficial since most maintenance activities revolve around source code. Accurate estimations of the maintenance effort spent on code changes would enable cost effective management of resources. In this research, we investigate a quantitative approach to express maintenance effort, for which a set of program-sliced metrics is proposed. Using the time to resolve an issue as a measure of maintenance effort, we evaluated our proposed metrics against the basic code-based metrics Lines of Code and McCabe's Cyclomatic Complexity. To eliminate outside factors, we performed an experimental case study on a set of pre-defined maintenance activities. Results suggest that program slicing metrics have the strongest correlation with maintenance effort, exhibiting a moderate degree of correlation with maintenance effort. In contrast, Lines of Code has a weak correlation with maintenance effort. This study contributes to our ongoing research into the analysis of maintenance processes. © 2012 IEEE.
Shibata M.,Osaka University |
Mega T.,Osaka University |
Ooshita F.,NAIST |
Kakugawa H.,Osaka University |
Masuzawa T.,Osaka University
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing | Year: 2016
In this paper, we consider the uniform deployment problem of mo- bile agents in asynchronous unidirectional rings, which requires the agents to uniformly spread in the ring. The uniform deployment problem is striking contrast to the rendezvous problem which re- quires the agents to meet at the same node. While the rendezvous aims to break the symmetry, the uniform deployment aims to attain the symmetry. Hence, we are interested in clarifying how easily the uniform deployment problem can be solved compared to the rendezvous problem. We consider two problem settings. First, we consider agents with knowledge of κ, where κ is the number of agents. In this case, our proposed algorithm solves the uniform deployment problem with termination detection. This algorithm requires O(log n) memory per agent, O(n log κ) time, and O(κn) total moves, where n is the number of nodes. Next, we consider agents with no knowledge of κ or n. In this case, we show that, when termination detection is required, there exists no algorithm to solve the uniform deployment problem. For this reason, we con- sider the relaxed uniform deployment problem that does not re- quire termination detection, and we propose an algorithm to solve the relaxed uniform deployment problem. This algorithm requires O(κ/l log(n/l)) memory per agent, O(n/l) time, and O(κn/l) total moves, where l is the symmetry degree of the initial configu- ration (l ≥ 1). Note that both the algorithms achieve the uniform deployment from any initial configuration, which is a striking dif- ference from the rendezvous problem because the rendezvous prob- lem is not solvable from some initial configurations. © 2016 ACM.
Yang X.,NAIST |
Kula R.G.,Osaka University |
Yoshida N.,Nagoya University |
Proceedings - 13th Working Conference on Mining Software Repositories, MSR 2016 | Year: 2016
In this paper, we present a collection of Modern Code Review data for five open source projects. The data showcases mined data from both an integrated peer review system and source code repositories. We present an easy-to-use and richer data structure to retrieve the (a) People, (b) Process, and (c) Product aspects of the peer review. This paper presents the extraction methodology, the dataset structure, and a collection of database dumps1. © 2016 ACM.
Hamasaki K.,NAIST |
Kula R.G.,NAIST |
Yoshida N.,NAIST |
Camargo Cruz A.E.,NAIST |
And 2 more authors.
IEEE International Working Conference on Mining Software Repositories | Year: 2013
We present four datasets that are focused on the general roles of OSS peer review members. With data mined from both an integrated peer review system and code source repositories, our rich datasets comprise of peer review data that was automatically recorded. Using the Android project as a case study, we describe our extraction methodology, the datasets and their application used for three separate studies. Our datasets are available online at http://sdlab.naist.jp/reviewmining/. © 2013 IEEE.