snu-aidas/HVMap-dataset huggingface dataset:
The art of scenarios and strategic planning : tools and pitfalls

The term strategy has been misused and even abused. Worse, the word scenario is often confused with strategy to the point that clarification is needed if we are to understand one another. As a prolongation of the work done by the Rand Corporation in the 1960s, strategic planning, management and prospective approaches have been developed to help organizations master change. Over the past 25 years, we have contributed by creating or further developing various methodologies and procedures such as the Mactor and MICMAC methods for use in scenario building. These tools are doubly powerful in that they stimulate the imagination, reduce collective biases, and promote appropriation. One of the main functions of the strategic futures exercise is to eliminate two errors that we usually describe as the “hammer’s risk” and the “nail’s dream.” In other words, we forget what a hammer’s function is when staring at a nail (the nail’s dream) or we know how to use a hammer and imagine that every problem is like a nail (the hammer’s risk). In our case, we strive to give simple tools that may be appropriated. However, these simple tools are inspired by intellectual rigor that enables one to ask the right questions. Of course, these tools do not come with a guarantee. The natural talent, common sense, and intuition of the futurist also count!  2000 Elsevier Science Inc. Introduction Anticipation is not widely practiced by decision makers because when things are going well, they can manage without it, and when things are going badly, it is too late to see beyond the ends of their noses. Fast action is already urgently required! Yet reaction is not an end in itself. Although desirable in the short term, it leads nowhere if not directed towards the firm’s long-term objectives. As Seneca said, “there is no favourable wind for the man who knows not where he is going.” Action becomes meaningless without a goal, and only anticipation points the way to action and gives it both meaning and direction. MICHEL GODET is Professor and holder of the Chaire de prospective industrielle du Conservatoire national des arts et métiers, Paris, France, Director of the Laboratory of Investigation in Prospective and Strategy (LIPS). See: lips@cnam.fr, http://www.cnam.fr/lips/, where there is an on-line working paper Scenarios and Strategies: A Toolbox for Scenario Planning. Address correspondence to Michel Godet, LIPS, CNAM, 2 rue Conte, 75141 Paris, Cedex 03, France. Tel.: 33-01-4027 2530; Fax: 33-01-40 27 27 43; e-mail: lips@cnam.fr. Technological Forecasting and Social Change 65, 3–22 (2000)  2000 Elsevier Science Inc. All rights reserved. 0040-1625/00/$–see front matter 655 Avenue of the Americas, New York, NY 10010 PII S0040-1625(99)00120-1
Size dependency of nanocrystalline TiO 2 on its optical property and photocatalytic reactivity exemplified by 2-chlorophenol

Anatase TiO2 nanocrystallines (17–29 nm) were successfully synthesized by the metal–organic chemical vapor deposition method (MOCVD). Moderate manipulation of system parameters of MOCVD can control the particle size. The electro-optical and photocatalytic properties of the synthesized TiO2 nanoparticles were studied along with several commercially available ultra-fine TiO2 particles (e.g., 3.8–5.7 nm). The band gap of the TiO2 crystallines was determined using the transformed diffuse reflectance technique according to the Kubelka–Munk theory. Results showed that the band gap of TiO2 monotonically decreased from 3.239 to 3.173 eV when the particle size decreased from 29 to 17 nm and then increased from 3.173 to 3.289 eV as the particle size decreased from 17 to 3.8 nm. The results of band gap change as a function of particle size agreed well with what was predicted by the Brus’ equation, i.e., the effective mass model (EMM). However, results of the photocatalytic oxidation of 2-chlorophenol (2-CP), showed that the smaller the particle size, the faster the degradation rate. This is attributed in part to the combined effect of band gap change relative to the spectrum of the light source and the specific surface area (or particle size) of the photocatalysts. The change of band gap due to particle size represents only a small optical absorption window with respect to the total spectrum of the light source, i.e., from 380 to 400 nm versus>280 nm. Consequently, the gain in optical property of the larger particles was severely compromised by their decrease in specific surface area. Our results clearly indicated the importance of specific surface area in controlling the photocatalytic reactivity of photocatalysts. Results also showed that the secondary particle size grew with time due mainly to particle aggregation. The photocatalytic rate constants decreased exponentially with increase in primary particle size. Primary particle size alone is able to predict the photocatalytic rate as it is closely related to the electro-optical properties of photocatalysts. # 2006 Published by Elsevier B.V.
Development of a Danish Language Version of the Manchester Foot Pain and Disability Index: Reproducibility and Construct Validity Testing

Introduction. The Manchester Foot Pain and Disability Index (MFPDI) is a 19-item questionnaire for the assessment of disability caused by foot pain. The aim was to develop a Danish language version of the MFPDI (MFPDI-DK) and evaluate its reproducibility and construct validity. Methods. A Danish version was created, following a forward-backward translation procedure. A sample of 84 adult patients with foot pain was recruited. Participants completed two copies of the MFPDI-DK within a 24- to 48-hour interval, along with the Medical Outcomes Study Short Form 36 (SF-36), and a pain Visual Analog Scale (VAS). Reproducibility was assessed using the intraclass correlation coefficient (ICC) and 95% limits of agreement (Bland-Altman plot). Construct validity was evaluated with Pearson's Rho, using a priori hypothesized correlations with SF-36 subscales and VASmean. Results. The MFPDI-DK showed very good reliability with an ICC of 0.92 (0.88-0.95). The 95% limits of agreement ranged from -6.03 to 6.03 points. Construct validity was supported by moderate to very strong correlations with the SF-36 physical subscales and VASmean. Conclusion. The MFPDI-DK appears to be a valid and reproducible instrument in evaluating foot-pain-related disability in Danish adult patients in cross-sectional samples. Further research is needed to test the responsiveness of the MFPDI-DK.
A retrospective study of SPECT/CT scans using SUV measurement of the normal pelvis with Tc-99m methylene diphosphonate.

OBJECTIVE
To perform quantitative measurement based on the standardized uptake value (SUV) of Tc-99m methylene diphosphonate (MDP) in the normal pelvis using a single-photon emission tomography (SPECT)/computed tomography (CT) scanner.


MATERIAL AND METHODS
This retrospective study was performed on 31 patients with cancer undergoing bone SPECT/CT scans with 99mTc-MDP. SUVmax and SUVmean of the normal pelvis were calculated based on the body weight. SUVmax and SUVmean of the bilateral anterior superior iliac spine, posterior superior iliac spine, facies auricularis ossis ilii, ischial tuberosity, and sacrum were also calculated. Furthermore, the correlation of SUVmax and SUVmean of all parts of pelvis with weight, height, and CT was assessed.


RESULTS
The data for 31 patients (20 women and 11 men; mean age 58.97±9.12 years; age range 37-87 years) were collected. SUVmax and SUVmean changed from 1.65±0.40 to 3.8±1.0 and from 1.15±0.25 to 2.07±0.58, respectively. The coefficient of variation of SUVmax and SUVmean ranged from 0.22 to 0.31. SUVmax and SUVmean had no statistically significant difference between men and women. SUVmax and SUVmean also showed no significant correlation with weight and height. However, part of SUVmax and SUVmean showed a significant correlation with CT. In addition, SUVmax and SUVmean of the bilateral ischial tuberosity showed a significant correlation with CT values.


CONCLUSIONS
Determination of the SUV value of the normal pelvis with 99m Tc-MDP SPECT/CT is feasible and highly reproducible. SUVs of the normal pelvis showed a relatively large variability. As a quantitative imaging biomarker, SUVs might require standardization with adequate reference data for the participant to minimize variability.
Challenges in automotive software engineering

The amount of software in cars grows exponentially. Driving forces of this development are cheaper and more powerful hardware and the demand for innovations by new functions. The rapid increase of software and software based functionality brings various challenges (see [21], [23], [25], [26]) for the automotive industries, for their organization, key competencies, processes, methods, tools, models, product structures, division of work, logistics, maintenance, and long term strategies. From a software engineering perspective, the automotive industry is an ideal and fascinating application domain for advanced techniques. Although the automotive industry may adopt general results and solutions from the software engineering body of knowledge gained in other domains, the specific constraints and domain specific requirements in the automotive industry ask for individual solutions and bring various challenges for automotive software engineering. In cars we find literally all interesting problems and challenging issues of software and systems engineering.
Mutation Spectrum and Phenotypic Features in Noonan Syndrome with PTPN11 Mutations: Definition of Two Novel Mutations.

OBJECTIVES
To evaluate the spectrum of PTPN11 gene mutations in Noonan syndrome patients and to study the genotype-phenotype associations.


METHODS
In this study, twenty Noonan syndrome patients with PTPN11 mutations were included. The patients underwent a detailed clinical and physical evaluation. To identify inherited cases, parents of all mutation positive patients were analyzed.


RESULTS
Thirteen different PTPN11 mutations, two of them being novel, were detected in the study group. These mutations included eleven missense mutations: p.G60A, p.D61N, p.Y62D, p.Y63C, p.E69Q, p.Q79R, p.Y279C,p.N308D, p.N308S, p.M504V, p.Q510R and two novel missense mutations: p.I56V and p.I282M. The frequency of cardiac abnormalities and short stature were found to be 80 % and 80 %, respectively. Mental retardation was not observed in patients having exon 8 mutations. No significant correlations were detected between other phenotypic features and genotypes.


CONCLUSIONS
By identifying genotype-phenotype correlations, this study provides information on phenotypes observed in NS patients with different PTPN11 mutations.
Efficient Genome-Wide, Privacy-Preserving Similar Patient Query based on Private Edit Distance

Edit distance has been proven to be an important and frequently-used metric in many human genomic research, with Similar Patient Query (SPQ) being a particularly promising and attractive example. However, due to the widespread privacy concerns on revealing personal genomic data, the scope and scale of many novel use of genome edit distance are substantially limited. While the problem of private genomic edit distance has been studied by the research community for over a decade [6], the state-of-the-art solution [31] is far from even close to be applicable to real genome sequences. In this paper, we propose several private edit distance protocols that feature unprecedentedly high efficiency and precision. Our construction is a combination of a novel genomic edit distance ap- proximation algorithm and new construction of private set difference size protocols. With the private edit distance based secure SPQ primitive, we propose GENSETS, a genome-wide, privacy- preserving similar patient query system. It is able to support search- ing large-scale, distributed genome databases across the nation. We have implemented a prototype of GENSETS. The experimental results show that, with 100 Mbps network connection, it would take GENSETS less than 200 minutes to search through 1 million breast cancer patients (distributed nation-wide in 250 hospitals, each having 4000 patients), based on edit distances between their genomes of lengths about 75 million nucleotides each.
Fast Image Deconvolution using Hyper-Laplacian Priors

This document is supplementary material to our NIPS 2009 pap er [1] of the same name. While we choose to solve the w sub-problem (Eqn. 5) in [1] using a LUT or analytically (for s ome specific values ofα), a number of numerical alternatives exist. The simplest an d f stest approach is to use Newton-Raphson (NR) to find the roots of the polynomials in Eq . 10 and Eqn 11 of [1]. As shown in Table 1,4 iterations of NR take a similar time to our analytic solution . However, the numerical algorithm has poor stability, particularly when the polynomi als skim the x-axis. In practice, we found it gave spurious solutions around 1-2% of the time, an unacce ptable rate given the iterative nature of our overall algorithm. Applying NR directly to Eqn. 5 of [1] i s similarly unreliable. Although techniques with greater stability than NR exist, they are comput ationally more expensive. For example, we also compare to Matlab’s roots command, based on solving an eigenvalue problem, but this was several orders of magnitude slower than our analytic app ro ch.
Image description with features that summarize

We present a new method for describing images for the purposes of matching and registration. We take the point of view that large, coherent regions in the image provide a concise and stable basis for image description. We develop a new algorithm for feature detection that operates on several projections (feature spaces) of the image using kernel-based optimization techniques to locate local extrema of a continuous scale-space of image regions. Descriptors of these image regions and their relative geometry then form the basis of an image description. The emphasis of the work is on features that summarize image content and are highly robust to viewpoint changes and occlusion yet remain discriminative for matching and registration. We present experimental results of these methods applied to the problem of image retrieval. We find that our method performs comparably to two published techniques: Blobworld and SIFT features. However, compared to these techniques two significant advantages of our method are its (1) stability under large changes in the images and (2) its representational efficiency. 2008 Elsevier Inc. All rights reserved.
Feature recognition and shape design in sneakers

Article history: Available online xxxx
C4: the continuously concurrent compacting collector

C4, the Continuously Concurrent Compacting Collector, an updated generational form of the Pauseless GC Algorithm [7], is introduced and described, along with details of its implementation on modern X86 hardware. It uses a read barrier to support concur- rent compaction, concurrent remapping, and concurrent incremental update tracing. C4 differentiates itself from other generational garbage collectors by supporting simultaneous-generational concurrency: the different generations are collected using concurrent (non stop-the-world) mechanisms that can be simultaneously and independently active. C4 is able to continuously perform concurrent young generation collections, even during long periods of concurrent full heap collection, allowing C4 to sustain high allocation rates and maintain the efficiency typical to generational collectors, without sacrificing response times or reverting to stop-the-world operation. Azul systems has been shipping a commercial implementation of the Pauseless GC mechanism, since 2005. Three successive generations of Azul's Vega series systems relied on custom multi-core processors and a custom OS kernel to deliver both the scale and features needed to support Pauseless GC. In 2010, Azul released its first software-only commercial implementation of C4 for modern commodity X86 hardware, using Linux kernel enhancements to support the required feature set. We discuss implementa- tion details of C4 on X86, including the Linux virtual and physical memory management enhancements that were used to support the high rate of virtual memory operations required for sustained pauseless operation. We discuss updates to the collector's manage- ment of the heap for efficient generational collection and provide throughput and pause time data while running sustained workloads.
Process reengineering in the public sector : learning some private sector lessons

The possible applicability of business process reengineering (BPR) to organisations in the public sector is explored through analysis of the central issues in BPR and the emerging experience of organisations which have recently implemented it. In particular, the paper suggests that success of reengineering may depend critically on the strategic capability of the organisation prior to undertaking the effort. For that reason well-performing organisations are more likely to improve performance by means of BPR than are weak ones. Yet, in the public sector, it tends to be badly performing agencies which are most encouraged to undertake BPR. Knowing and understanding the reasons for success or failure of BPR in private organisations can prepare public sector managers for undertaking the effort, but each reengineering initiative must be tailored to the specific needs and circumstances of the individual agency. Public sector managers should use the widest possible definition of 'value' when analysing value-added in process reengineering and should be especially sensitive to the way in which 'value' in the public sector is differently interpreted by major stakeholders. During this learning process, public sector agencies would be well advised to be conservative in estimating gains from BPR. © 1997 Elsevier Science Ltd
Distributed Auction Algorithms for the Assignment Problem with Partial Information

operations centers (MOC), in which multiple DMs with partial information and partial control over assets are involved in the development of operational level plans. The MOC emphasizes standardized processes and methods, centralized assessment and guidance, networked distributed planning capabilities, and decentralized execution for assessing, planning and executing missions across a range of military operations  Abstract—Task-asset assignment is a fundamental problem paradigm in a wide variety of applications. Typical problem setting involves a single decision maker (DM) who has complete knowledge of the weight (reward, benefit, accuracy) matrix and who can control any of the assets to execute the tasks. Motivated by planning problems arising in distributed organizations, this paper introduces a novel variation of the assignment problem, wherein there are multiple DMs and each DM knows only a part of the weight matrix and/or controls a subset of the assets. We extend the auction algorithm to such realistic settings with various partial information structures using a blackboard coordination structure. We show that by communicating the bid, the best and the second best profits among DMs and with a coordinator, the DMs can reconstruct the centralized assignment solution. The auction setup provides a nice analytical framework for formalizing how team members build internal models of other DMs and achieve team cohesiveness over time. [1]. In this vein, we are developing analytical and computational models for multi-level coordinated mission planning and monitoring processes associated with MOCs, so that they can function effectively in highly dynamic, asymmetric, and unpredictable mission environments. Two key problem areas are: 1) realistic modeling of multi-level coordination structures that link tactical, operational and strategic levels of decision making; and 2) collaborative planning with partial information and partial control of assets. In the collaborating planning problem, each DM “owns” a set of assets and is responsible for planning certain tasks. Each task is characterized by a vector of resource requirements, while each asset is characterized by a vector of resource capabilities (see Fig. 1). Multiple assets (from the same DM or multiple DMs) may be required to process a task. The degree of match between the task-resource requirement vector and asset-resource capability vector determines the accuracy of task execution. In addition, the elements of
Data exfiltration: A review of external attack vectors and countermeasures

Context: One of the main targets of cyber-attacks is data exfiltration, which is the leakage of sensitive or private data to an unauthorized entity. Data exfiltration can be perpetrated by an outsider or an insider of an organization. Given the increasing number of data exfiltration incidents, a large number of data exfiltration countermeasures have been developed. These countermeasures aim to detect, prevent, or investigate exfiltration of sensitive or private data. With the growing interest in data exfiltration, it is important to review data exfiltration attack vectors and countermeasures to support future research in this field. Objective: This paper is aimed at identifying and critically analysing data exfiltration attack vectors and countermeasures for reporting the status of the art and determining gaps for future research. Method: We have followed a structured process for selecting 108 papers from seven publication databases. Thematic analysis method has been applied to analyse the extracted data from the reviewed papers. Results: We have developed a classification of (1) data exfiltration attack vectors used by external attackers and (2) the countermeasures in the face of external attacks. We have mapped the countermeasures to attack vectors. Furthermore, we have explored the applicability of various countermeasures for different states of data (i.e., in use, in transit, or at rest). Conclusion: This review has revealed that (a) most of the state of the art is focussed on preventive and detective countermeasures and significant research is required on developing investigative countermeasures that are equally important; (b) Several data exfiltration countermeasures are not able to respond in real-time, which specifies that research efforts need to be invested to enable them to respond in real-time (c) A number of data exfiltration countermeasures do not take privacy and ethical concerns into consideration, which may become an obstacle in their full adoption (d) Existing research is primarily focussed on protecting data in ‘in use’ state, therefore, future research needs to be directed towards securing data in ‘in rest’ and ‘in transit’ states (e) There is no standard or framework for evaluation of data exfiltration countermeasures. We assert the need for developing such an evaluation framework.
Motion Planning : The Essentials

This is the first installment of a two-part tutorial. The goal of the first part is to give the reader a basic understanding of the technical issues and types of approaches to solving the basic path planning or obstacle avoidance problem. The second installment will cover more advanced issues, including feedback, differential constraints, and uncert ainty. Note that is a brieftutorial, rather than a comprehensive surveyof methods. For the latter, consult recent textbooks [4], [9].