7848399
Model-driven software product lines
Model-driven software product lines combine the abstraction capability of Model Driven Software Development (MDSD) and the variability management capability of Software Product Line Engineering (SPLE). This short contribution motivates the idea of model-driven software product lines and briefly explains the concepts underlying feature-based model templates, which is a particular technique for modeling software product lines.
8872211
Synchronizing Cardinality-Based Feature Models and Their Specializations
A software product line comprises a set of products implementing different configurations of features. The set of valid feature configurations within a product line can be described by a feature model. In some practical situations, a feature configuration needs to be derived in stages by creating a series of successive specializations of the initial feature model. In this paper, we consider the scenario where changes to the feature model due to, for example, the evolution of the product line, need to be propagated to its existing specializations and configurations. After discussing general dimensions of model synchronization, a solution to synchronizing cardinality-based feature models and their specializations and configurations is presented.
42768359
Hardware-Accelerated Real-Time Rendering for 3D Sumi-e Painting
This paper presents a method for real-time 3D Sumi-e rendering using normal graphics hardware. Sumi-e is one of the traditional oriental painting styles. Most research on Sumi-e paintings has focused on 2D or 2.5D Sumi-e brushwork simulation. On these systems, complicated user's hand drawing is required to generate the image of Sumi-e effects, and it can render the 2D or 2.5D Sumi-e images only. We present an automated rendering system for 3D image of Sumi-e painting. It uses 3D common object as an input data and does not need any additional input of user brushwork. Especially for the real-time rendering, hardware-accelerated algorithm for Sumi-e rendering is newly suggested in our system. It is designed with efficiency for customer level graphics hardware. The results of this paper show that the features of traditional Sumi-e painting are successfully modeled and that 3D Sumi-e painting is rendered in real-time effectively.
12867787
I Am Fine but You Are Not: Optimistic Bias and Illusion of Control on Information Security
Information security is a critically important issue in current networked business and work environments. While there is extensive publicity on the increasing incidents of numerous information security breaches and their serious consequences, recent surveys and research on information security repeatedly identify the low levels of user and managerial awareness as a key obstacle to achieving a good information security posture. The main motivation of our research emanates from this contradicting phenomenon: increased vulnerability to information security breaches yet the low level of user and managerial awareness on information security threats. In this research, we study this dissonance by addressing a cognitive bias, optimistic bias, that is, the tendency of people to believe that negative events are less likely to happen to them than to others and that positive events are more likely to happen to them than others. Using a survey, we find that users demonstrate optimistic bias in their risk perceptions associated with information security. This self-serving bias is also found to be related to a perception of controllability with information security threats. These results have practical implications for designing security awareness programs by suggesting that risk communication and management efforts are likely to fail unless they consider this bias.
36481442
An Efficient Revocation Scheme for Stateless Receivers
A revocation scheme for stateless receivers enables the center to deliver information securely to the legitimate users over a public channel, where the receivers do not update their state from session to session. In this paper, we propose an efficient revocation scheme for stateless receivers. Our scheme uses a logical hierarchical key tree. Among previously proposed revocation schemes for stateless receivers, the SD scheme [10] is very efficient with respect to message length and Asano’s schemes [1] are very efficient with respect to key storage. Using a binary key tree, our scheme has the same message length as the SD scheme and requires the storage of log n keys, whereas the SD scheme requires the storage of \(\frac{1}{2}\log ^{2} n + \frac{1}{2}\log n + 1\) keys. Using an a-ary key tree, our scheme has the same key storage as Asano’s method 2 and requires a message length of at most 2r–1, whereas Asano’s schemes require a message length of at most \(r(\frac{\log\frac{n}{r}}{\log a} +1)\). Therefore, our scheme is more efficient than the SD scheme and Asano’s schemes.
6889249
Discrete differential error metric for surface simplification
In this paper we propose a new discrete differential error metric for surface simplification. Many surface simplification algorithms have been developed in order to produce rapidly high quality approximations of polygonal models, and the quadric error metric based on the distance error is the most popular and successful error metric so far Even though such distance based error metrics give visually pleasing results with a reasonably fast speed, it is hard to measure an accurate geometric error on a highly curved and thin region since the error measured by the distance metric on such a region is usually small and causes a loss of visually important features. To overcome such a drawback, we define a new error metric based on the theory of local differential geometry in such a way that the first and the second order discrete differentials approximated locally on a discrete polygonal surface are integrated into the usual distance error metric. The benefits of our error metric are preservation of sharp feature regions after a drastic simplification, small geometric errors, and fast computation comparable to the existing methods.
12552933
TTS without Revocation Capability Secure Against CCA2
A traitor tracing scheme (TTS) deters traitors from giving away their secret keys to decrypt the transmitted data by enabling the system manager to trace at least one of the traitors who participated in the construction of a pirate decoder after confiscating it. In an asymmetric scheme, the system manager is also under suspicion, so the system manager must convince a judge of the implication of the traitors. Recently, Kiayias and Yung proposed an asymmetric public key traitor tracing scheme [13]. However, their scheme does not provide CCA2 security even if a single user is a traitor. That is, their scheme is secure against adaptive chosen ciphertext (CCA2) attack only when there is no traitor. In this paper, we first introduce the security notion against CCA2 attack in a traitor tracing scheme with no revocation capability. This notion is somewhat different from the traditional security notion against CCA2 attack in a two-party encryption scheme [5]. To the best of our knowledge, no security notion against CCA2 attack in a traitor tracing scheme with no revocation capability has been presented. In addition, we modify the Kiayias and Yung’s scheme to achieve security against CCA2 attack under the decision Diffie-Hellman assumption and the collision-resistant hash function assumption.