title: THE DEVELOPMENT OF THE BALANCED SCORECARD AS A STRATEGIC MANAGEMENT TOOL

text: The Balanced Scorecard is a widely adopted performance management framework first described in the early 1990s. More recently it has been proposed as the basis for a ‘strategic management system’. This paper describes its evolution, recognising three distinct generations of Balanced Scorecard design. The paper relates the empirically driven developments in Balanced Scorecard thinking with literature concerning strategic management within organisations. It concludes that developments to date have been worthwhile, highlights potential areas for further refinement, and sets out some possible topics for future research into the field. The Balanced Scorecard and its development The Balanced Scorecard was first introduced in the early 1990s through the work of Robert Kaplan and David Norton of the Harvard Business School. Since then, the concept has become well known and its various forms widely adopted across the world (Rigby, 2001). By combining financial measures and non-financial measures in a single report, the Balanced Scorecard aims to provide managers with richer and more relevant information about activities they are managing than is provided by financial measures alone. To aid clarity and utility, Kaplan and Norton proposed that the number of measures on a Balanced Scorecard should also be constrained in number, and clustered into four groups (Kaplan and Norton, 1992, 1993). Beyond this, the original definition of Balanced Scorecard was sparse. But from the outset it was clear that the selection of measures, both in terms of filtering (organisations typically had access to many more measures than were needed to populate the Balanced Scorecard) and clustering (deciding which measures should appear in which perspectives) would be a key activity. Kaplan and Norton proposed that measure selection should focus on information relevant to the implementation of strategic plans, and that simple attitudinal questions be used to help determine the appropriate allocation of measures to perspectives (Kaplan and Norton, 1992). In essence the Balanced Scorecard has remained unchanged since these early papers, having at its core a limited number of measures clustered into groups, and an underlying strategic focus. But modern Balanced Scorecard designs also have a number of features that clearly differentiate them from earlier examples. This paper describes these changes as an evolution through three distinct ‘generations’ of Balanced Scorecard design. 1 Generation Balanced Scorecard Balanced Scorecard was initially described as a simple, “4 box” approach to performance measurement (Kaplan and Norton, 1992). In addition to financial measures, managers were encouraged to look at measures drawn from three other “perspectives” of the business: Learning and Growth; Internal Business Process; and Customer, chosen to represent the major stakeholders in a business (Mooraj et al, 1999). Definition of what comprised a Balanced Scorecard was sparse and focused on the high level structure of the device. Simple ‘causality’ between the four perspectives was illustrated but not used for specific purpose. Kaplan and Norton’s original paper’s focus was on the selection and reporting of a limited number of measures in each of the four perspectives (Kaplan and Norton, 1992). The paper suggested use of attitudinal questions relating to the vision and goals of the organisation to help in the selection of measures to be used, and also encouraged the consideration of ‘typical’ areas of interest in this process. Kaplan and Norton’s original work makes no specific observations concerning how the Balanced Scorecard might improve the performance of organisations; the implication is that the provision of accessible relevant measurement data itself will trigger improved organisational performance. However, they do imply that the source of these improvements is changes in behaviour: “It establishes goals but assumes that people will adopt whatever behaviours and take whatever actions are necessary to arrive at those goals”. In the light of this, the basis for selecting the goals represented by the Balanced Scorecard is of some importance. But in their first paper Kaplan and Norton say little about how a Balanced Scorecard could be developed in practice beyond a general assertion that design involved “putting vision and strategy at the centre of the measurement system” (1992). Later writing includes increasing amounts of proscription about development methods, concluding with a lengthy description of one such process in their first book on the subject published in 1996. Figure 1 – 1 Generation Balanced Scorecard Figure 1 shows a diagrammatic representation of Kaplan and Norton’s original Balanced Scorecard design. We will subsequently refer to this type of Balanced Scorecard design as a ‘1 Generation’ Balanced Scorecard. Key attributes of the design and suggested development process for this type of Balanced Scorecard are summarised in the table below. Practical Experiences with 1 Generation Balanced Scorecards The authors’ professional experience suggests that 1 Generation Balanced Scorecards are still being developed, and that they probably still form the large majority of Balanced Scorecard designs introduced into organisations. This is reflected in the literature, where books and articles that use more advanced representations of Balanced Scorecard are only recently appearing (Olve et al, 1999, Kaplan and Norton, 2000, Niven, 2002). But despite its huge popularity as a concept, and apparently widespread adoption, relatively few detailed case studies concerning Balanced Scorecard implementation experiences appear to exist in the academic literature. Those few that do focus primarily on the architecture of the Balanced Scorecard design (e.g. Butler et al, 1997), and associated organisational experiences (e.g. Ahn, 2001). Commercial / practitioner writing on Balanced Scorecard is more extensive (e.g. Schneiderman, 1999), but often more partisan (e.g. Lingle et al 1996). But in general the literature endorses the utility of the approach (Epstein et al, 1997) but notes weaknesses in the initial design proposition, and recommends improvements (e.g. Eagleson et al, 2000, Kennerley et al, 2000). 2 Generation Balanced Scorecard The practical difficulties associated with the design of 1 Generation Balanced Scorecards are significant, in part because the definition of a Balanced Scorecard was initially vague, allowing for considerable interpretation. Two significant areas of concern were filtering (the process of choosing specific measures to report), and clustering (deciding how to group measures into ‘perspectives’). Discussions relating to clustering continue to be rehearsed in the literature (e.g. Butler et al, 1997, Kennerley et al, 2000), but discussions relating to filtering are less common, and usually appear as part of descriptions of methods of Balanced Scorecard design (e.g. Kaplan and Norton, 1996, Olve et al, 1999). Perhaps the most significant early change translated the attitudinal approach to measure selection proposed initially be Kaplan and Norton (e.g. “To succeed financially, how should we appear to our shareholders?”) into a process that yielded a few appropriate key measures of performance in each perspective. A solution was the introduction of the concept of ‘strategic objectives’ (Kaplan and Norton, 1993). Initially these were represented as short sentences attached to the four perspectives, and were used to capture the essence of the organisation’s strategy material to each of the areas: measures were then selected that reflected achievement of these strategic objectives. Although subtle, this approach to measure selection quite different from that initially proposed, since strategic objectives were developed directly from strategy statements based on a corporate vision or a strategic plan. Another key development concerned causality. Causality between the perspectives had been introduced in early ‘1st Generation’ Balanced Scorecard thinking (see Figure 1). ‘2nd Generation’ Balanced Scorecard saw the idea of causality developed further. Instead of simply highlighting causal links between perspectives, internal documents from one consulting firm’s work in 1993 shows an early attempt to indicate linkages between the measures themselves. This improvement was also proposed later by others (Newing, 1995). Measure based linkages provided a richer model of causality than before, but presented conceptual problems – for example, the use of measures encouraged attempts to ‘prove’ the causality between measures using various forms of analysis (indeed this is still the case – e.g. Brewer, 2002). Collectively the changes in design described here represent a materially different definition of what comprises a Balanced Scorecard compared to Kaplan and Norton’s original work we will refer to Balanced Scorecards that incorporate these developments as ‘2 Generation Balanced Scorecards’. The impact of these changes were characterised by Kaplan and Norton in 1996 as enabling the Balanced Scorecard to evolve from “an improved measurement system to a core management system” (Kaplan and Norton 1996). Maintaining the focus that Balanced Scorecard was intended to support the management of strategic implementation, Kaplan and Norton further described the use of this development of the Balanced Scorecard as the central element of “a strategic management system”. One consequence of this change in emphasis was to increase the pressure on the design process to accurately reflect the organisation’s strategic goals. Over time the idea of strategic linkage became an increasingly important element of Balanced Scorecard design methodology, and in the mid 1990’s Balanced Scorecard documentation began to show graphically linkages between the strategic objectives themselves (rather than the measures) with causality linking across the perspectives toward key objectives re


title: An agent-based decision support system for wholesale electricity market

text: Application software has been developed for analyzing and understanding a dynamic price change in the US wholesale power market. Traders can use the software as an effective decision-making tool by modeling and simulating a power market. The software uses different features of a decision support system by creating a framework for assessing new trading strategies in a competitive electricity trading environment. The practicality of the software is confirmed by comparing its estimation accuracy with those of other methods (e.g., neural network and genetic algorithm). The software has been applied to a data set regarding the California electricity crisis in order to examine whether the learning (convergence) speed of traders is different between the two periods (before and during the crisis). Such an application confirms the validity of the proposed software. © 2007 Elsevier B.V. All rights reserved.


title: Tuning of PID controller using Ziegler-Nichols method for speed control of DC motor

text: In this paper, a weighted tuning methods of a PID speed controller for separately excited Direct current motor is presented, based on Empirical Ziegler-Nichols tuning formula and modified Ziegler-Nichol PID tuning formula. Both these methods are compared on the basis of output response, minimum settling time, and minimum overshoot for speed demand application of DC motor. Computer simulation shows that the performance of PID controller using Modified Ziegler-Nichols technique is better than that of traditional Ziegler-Nichols technique.


title: Comparative analysis of RADAR-IR sensor fusion methods for object detection

text: This paper presents the Radar and IR sensor fusion method for objection detection. The infrared camera parameter calibration with Levenberg-Marquardt (LM) optimization method is proposed based on the Radar ranging data represented by Cartesian coordinate compared with 6 fusion methods. The proposed method firstly performs the estimation of the intrinsic parameter matrix of infrared camera with some optical trick. Then the method searches the extrinsic parameters using the generative approach. The initial angle and translation of the extrinsic parameters are optimized by the LM method with the geometrical cost function. In the experiments, the performance of proposed method outperforms by a maximum 13 times the performance of the other baseline methods on the averaged Euclidian distance error. In future work, the angular noise of the Radar information will be improved and the proposed method will provide the effective proposals for the deep neural network.


title: Noise-Immune Embedded NAND-ROM Using a Dynamic Split Source-Line Scheme for VDDmin and Speed Improvements

text: Embedded NAND-type read-only-memory (NAND-ROM) provides large-capacity, high-reliability, on-chip non-volatile storage. However, NAND-ROM suffers from code-dependent read noises and cannot survive at low supply voltages (VDDs). These code-dependent read noises are primarily due to the charge-sharing effect, bitline leakage current, and crosstalk between bitlines, which become worse at lower VDD. This study proposes a dynamic split source-line (DSSL) scheme for NAND-ROM. The proposed scheme overcomes code-dependent read noises while improving the read access time and suppressing the active-mode gate leakage current, with only a 1% area penalty in the cell array. Experiments on a fabricated 256 Kb macro using a 90 nm industrial logic process demonstrate that the proposed DSSL scheme achieves 100% code-pattern coverage under a small sensing margin. Additionally, the DSSL NAND-ROM works with a wide range of supply voltages (1-0.31 V) with a 38%, 45.8%, and 37% improvement in speed, power, and standby current, respectively, at VDD = 1 V.


title: FlowQA: Grasping Flow in History for Conversational Machine Comprehension

text: Conversational machine comprehension requires a deep understanding of the conversation history. To enable traditional, single-turn models to encode the history comprehensively, we introduce FLOW, a mechanism that can incorporate intermediate representations generated during the process of answering previous questions, through an alternating parallel processing structure. Compared to shallow approaches that concatenate previous questions/answers as input, FLOW integrates the latent semantics of the conversation history more deeply. Our model, FLOWQA, shows superior performance on two recently proposed conversational challenges (+7.2% F1 on CoQA and +4.0% on QuAC). The effectiveness of FLOW also shows in other tasks. By reducing sequential instruction understanding to conversational machine comprehension, FLOWQA outperforms the best models on all three domains in SCONE, with +1.8% to +4.4% improvement in accuracy.


title: Not All Neural Embeddings are Born Equal

text: Neural language models learn word representations that capture rich linguistic and conceptual information. Here we investigate the embeddings learned by neural machine translation models. We show that translation-based embeddings outperform those learned by cutting-edge monolingual models at single-language tasks requiring knowledge of conceptual similarity and/or syntactic role. The findings suggest that, while monolingual models learn information about how concepts are related, neural-translation models better capture their true ontological status. It is well known that word representations can be learned from the distributional patterns in corpora. Originally, such representations were constructed by counting word co-occurrences, so that the features in one word’s representation corresponded to other words [11, 17]. Neural language models, an alternative means to learn word representations, use language data to optimise (latent) features with respect to a language modelling objective. The objective can be to predict either the next word given the initial words of a sentence [4, 14, 8], or simply a nearby word given a single cue word [13, 15]. The representations learned by neural models (sometimes called embeddings) generally outperform those acquired by co-occurrence counting models when applied to NLP tasks [3]. Despite these clear results, it is not well understood how the architecture of neural models affects the information encoded in their embeddings. Here, we explore this question by considering the embeddings learned by architectures with a very different objective function to monolingual language models: neural machine translation models. We show that translation-based embeddings outperform monolingual embeddings on two types of task: those that require knowledge of conceptual similarity (rather than simply association or relatedness), and those that require knowledge of syntactic role. We discuss what the findings indicate about the information content of different embeddings, and suggest how this content might emerge as a consequence of the translation objective. 1 Learning embeddings from language data Both neural language models and translation models learn real-valued embeddings (of specified dimension) for words in some pre-specified vocabulary, V , covering many or all words in their training corpus. At each training step, a ‘score’ for the current training example (or batch) is computed based on the embeddings in their current state. This score is compared to the model’s objective function, and the error is backpropagated to update both the model weights (affecting how the score is computed from the embeddings) and the embedding features. At the end of this process, the embeddings should encode information that enables the model to optimally satisfy its objective. 1.1 Monolingual models In the original neural language model [4] and subsequent variants [8], each training example consists of n subsequent words, of which the model is trained to predict the n-th word given the first n − 1 ar X iv :1 41 0. 07 18 v2 [ cs .C L ] 1 3 N ov 2 01 4 1 words. The model first represents the input as an ordered sequence of embeddings, which it transforms into a single fixed length ‘hidden’ representation by, e.g., concatenation and non-linear projection. Based on this representation, a probability distribution is computed over the vocabulary, from which the model can sample a guess at the next word. The model weights and embeddings are updated to maximise the probability of correct guesses for all sentences in the training corpus. More recent work has shown that high quality word embeddings can be learned via models with no nonlinear hidden layer [13, 15]. Given a single word in the corpus, these models simply predict which other words will occur nearby. For each word w in V , a list of training cases (w, c) : c ∈ V is extracted from the training corpus. For instance, in the skipgram approach [13], for each ‘cue word’ w the ‘context words’ c are sampled from windows either side of tokens of w in the corpus (with c more likely to be sampled if it occurs closer to w).1 For each w in V , the model initialises both a cue-embedding, representing the w when it occurs as a cue-word, and a context-embedding, used when w occurs as a context-word. For a cue word w, the model can use the corresponding cueembedding and all context-embeddings to compute a probability distribution over V that reflects the probability of a word occurring in the context of w. When a training example (w, c) is observed, the model updates both the cue-word embedding of w and the context-word embeddings in order to increase the conditional probability of c. 1.2 Translation-based embeddings Neural translation models generate an appropriate sentence in their target language St given a sentence Ss in their source language [see, e.g., 16, 6]. In doing so, they learn distinct sets of embeddings for the vocabularies Vs and Vt in the source and target languages respectively. Observing a training case (Ss, St), such a model represents Ss as an ordered sequence of embeddings of words from Vs. The sequence for Ss is then encoded into a single representation RS .2 Finally, by referencing the embeddings in Vt, RS and a representation of what has been generated thus far, the model decodes a sentence in the target language word by word. If at any stage the decoded word does not match the corresponding word in the training target St, the error is recorded. The weights and embeddings in the model, which together parameterise the encoding and decoding process, are updated based on the accumulated error once the sentence decoding is complete. Although neural translation models can differ in low-level architecture [7, 2], the translation objective exerts similar pressure on the embeddings in all cases. The source language embeddings must be such that the model can combine them to form single representations for ordered sequences of multiple words (which in turn must enable the decoding process). The target language embeddings must facilitate the process of decoding these representations into correct target-language sentences. 2 Comparing Mono-lingual and Translation-based Embeddings To learn translation-based embeddings, we trained both the RNN encoder-decoder [RNNenc, 7] and the RNN Search architectures [2] on a 300m word corpus of English-French sentence pairs. We conducted all experiments with the resulting (English) source embeddings from these models. For comparison, we trained a monolingual skipgram model [13] and its Glove variant [15] for the same number of epochs on the English half of the bilingual corpus. We also extracted embeddings from a full-sentence language model [CW, 8] trained for several months on a larger 1bn word corpus. As in previous studies [1, 5, 3], we evaluate embeddings by calculating pairwise (cosine) distances and correlating these distances with (gold-standard) human judgements. Table 1 shows the correlations of different model embeddings with three such gold-standard resources, WordSim-353 [1], MEN [5] and SimLex-999 [10]. Interestingly, translation embeddings perform best on SimLex-999, while the two sets of monolingual embeddings perform better on modelling the MEN and WordSim353. To interpret these results, it should be noted that SimLex-999 evaluation quantifies conceptual similarity (dog wolf ), whereas MEN and WordSim-353 (despite its name) quantify more general relatedness (dog collar) [10]. The results seem to indicate that translation-based embeddings better capture similarity, while monolingual embeddings better capture relatedness. 1 Subsequent variants use different algorithms for selecting the (w, c) from the training corpus [9, 12] Alternatively, subsequences (phrases) of Ss may be encoded at this stage in place of the whole sentence [2].


title: Entity Linking meets Word Sense Disambiguation: a Unified Approach

text: Entity Linking (EL) and Word Sense Disambiguation (WSD) both address the lexical ambiguity of language. But while the two tasks are pretty similar, they differ in a fundamental respect: in EL the textual mention can be linked to a named entity which may or may not contain the exact mention, while in WSD there is a perfect match between the word form (better, its lemma) and a suitable word sense. In this paper we present Babelfy, a unified graph-based approach to EL and WSD based on a loose identification of candidate meanings coupled with a densest subgraph heuristic which selects high-coherence semantic interpretations. Our experiments show state-of-the-art performances on both tasks on 6 different datasets, including a multilingual setting. Babelfy is online at http://babelfy.org


title: Align, Disambiguate and Walk: A Unified Approach for Measuring Semantic Similarity

text: Semantic similarity is an essential component of many Natural Language Processing applications. However, prior methods for computing semantic similarity often operate at different levels, e.g., single words or entire documents, which requires adapting the method for each data type. We present a unified approach to semantic similarity that operates at multiple levels, all the way from comparing word senses to comparing text documents. Our method leverages a common probabilistic representation over word senses in order to compare different types of linguistic data. This unified representation shows state-ofthe-art performance on three tasks: semantic textual similarity, word similarity, and word sense coarsening.


title: Cycling Down Under : A Comparative Analysis of Bicycling Trends and Policies in Sydney and Melbourne

text: The purpose of this paper is to document and explain differences in cycling between Australia’s two largest cities. Our comparative case study analysis is based on a wide range of statistical datasets, secondary reports, and interviews with a panel of 22 bicycling policy and planning experts. The main finding is that cycling levels in Melbourne are roughly twice as high as in Sydney and have been growing three times as fast in recent years. The difference is due to Melbourne’s more favorable topography, climate, and road network as well as more supportive public policies. In particular, Melbourne has more and better integrated cycling infrastructure as well as more extensive cycling programs, advocacy, and promotional events. Melbourne also benefits from safer cycling than Sydney, which suffers from a lack of traffic-protected cycling facilities and aggressive motorist behavior toward cyclists on the road. While cycling has been increasing in Australia, it remains at very low levels relative to northern Europe, where both land use and transport policies are far more supportive of bicycling while discouraging car use through numerous restrictions and financial disincentives.


title: An attack scenario and mitigation mechanism for enterprise BYOD environments

text: The recent proliferation of the Internet of Things (IoT) technology poses major security and privacy concerns. Specifically, the use of personal IoT devices, such as tablets, smartphones, and even smartwatches, as part of the Bring Your Own Device (BYOD) trend, may result in severe network security breaches in enterprise environments. Such devices increase the attack surface by weakening the digital perimeter of the enterprise network and opening new points of entry for malicious activities. In this paper we demonstrate a novel attack scenario in an enterprise environment by exploiting the smartwatch device of an innocent employee. Using a malicious application running on a suitable smartwatch, the device imitates a real Wi-Fi direct printer service in the network. Using this attack scenario, we illustrate how an advanced attacker located outside of the organization can leak/steal sensitive information from the organization by utilizing the compromised smartwatch as a means of attack. An attack mitigation process and countermeasures are suggested in order to limit the capability of the remote attacker to execute the attack on the network, thus minimizing the data leakage by the smartwatch.


Introduction to Algorithms, 3rd Edition


Impact of an augmented reality system on students' motivation for a visual art course


title: OTPaaS—One Time Password as a Service

text: Conventional password-based authentication is considered inadequate by users as many online services started to affect each other. Online credentials are used to recover other credentials and complex attacks are directed to the weakest one of many of these online credentials. As researchers are looking for new authentication techniques, one time passwords, which is a two-factor authentication scheme, looks like a natural enhancement over conventional username/password schemes. The manuscript places the OTP verifier to the cloud to ease adoption of its usage by cloud service providers. When the OTP verifier is placed on the cloud as a service, other cloud service providers could outsource their OTP deployments as well as cloud users could activate their respective account on the OTP provider on several cloud services. This enables them to use several cloud services without the difficulty of managing several OTP accounts for each cloud service. On the other hand, OTP service provision saves inexperienced small to medium enterprises from spending extra costs for OTP provisioning hardware, software, and employers. The paper outlines architecture to build a secure, privacy-friendly, and sound OTP provider in the cloud to outsource the second factor of authentication. Cloud user registration to OTP provider, service provider activation, and authentication phases are inspected. The security and privacy considerations of the proposed architecture are defined and analyzed. Attacks from outsiders, unlinkability properties of user profiles, attacks from curious service providers or OTP verifiers are mitigated within the given assumptions. The proposed solution, which locates the OTP provider in the cloud, is rendered robust and sound as a result of the analysis.


title: POLSAR Image Classification via Wishart-AE Model or Wishart-CAE Model

text: Neural network such as an autoencoder (AE) and a convolutional autoencoder (CAE) have been successfully applied in image feature extraction. For the statistical distribution of polarimetric synthetic aperture radar (POLSAR) data, we combine the Wishart distance measurement into the training process of the AE and the CAE. In this paper, a new type of AE and CAE is specially defined, which we name them Wishart-AE (WAE) and Wishart-CAE (WCAE). Furthermore, we connect the WAE or the WCAE with a softmax classifier to compose a classification model for the purpose of POLSAR image classification. Compared with AE and CAE models, WAE and WCAE models can achieve higher classification accuracy because they could obtain the classification features, which are more suitable for POLSAR data. What is more, the WCAE model utilizes the local spatial information of a POLSAR image when compared with the WAE model. A convolutional natural network (CNN), which also makes use of the spatial information, has been widely applied in image classification, but our WCAE model is time-saving than the CNN model. Given the above, our methods not only improve the classification performance but also save the experimental time. Experimental results on four POLSAR datasets also demonstrate that our proposed methods are significantly effective.


title: Comparison of database replication techniques based on total order broadcast

text: In this paper, we present a performance comparison of database replication techniques based on total order broadcast. While the performance of total order broadcast-based replication techniques has been studied in previous papers, this paper presents many new contributions. First, it compares with each other techniques that were presented and evaluated separately, usually by comparing them to a classical replication scheme like distributed locking. Second, the evaluation is done using a finer network model than previous studies. Third, the paper compares techniques that offer the same consistency criterion (one-copy serializability) in the same environment using the same settings. The paper shows that, while networking performance has little influence in a LAN setting, the cost of synchronizing replicas is quite high. Because of this, total order broadcast-based techniques are very promising as they minimize synchronization between replicas.


title: A printed 16 ports massive MIMO antenna system with directive port beams

text: The design of a massive multiple-input-multiple-output (mMIMO) antenna system based on patch antennas is presented in this paper. The array consists of 16 ports, each port consists of a 2×2 patch antenna array with different phase excitation at each element to tilt the beam toward different directions to provide lower correlation coefficient values. A fixed progressive phase feed network is designed to provide the beam tilts. The proposed antenna system is designed using a 3-layer FR4 substrate with total size of 33.33×33.33×0.16 cm3.


title: Social influence based clustering of heterogeneous information networks

text: Social networks continue to grow in size and the type of information hosted. We witness a growing interest in clustering a social network of people based on both their social relationships and their participations in activity based information networks. In this paper, we present a social influence based clustering framework for analyzing heterogeneous information networks with three unique features. First, we introduce a novel social influence based vertex similarity metric in terms of both self-influence similarity and co-influence similarity. We compute self-influence and co-influence based similarity based on social graph and its associated activity graphs and influence graphs respectively. Second, we compute the combined social influence based similarity between each pair of vertices by unifying the self-similarity and multiple co-influence similarity scores through a weight function with an iterative update method. Third, we design an iterative learning algorithm, SI-Cluster, to dynamically refine the K clusters by continuously quantifying and adjusting the weights on self-influence similarity and on multiple co-influence similarity scores towards the clustering convergence. To make SI-Cluster converge fast, we transformed a sophisticated nonlinear fractional programming problem of multiple weights into a straightforward nonlinear parametric programming problem of single variable. Our experiment results show that SI-Cluster not only achieves a better balance between self-influence and co-influence similarities but also scales extremely well for large graph clustering.


title: Unemployment alters the set point for life satisfaction.

text: According to set-point theories of subjective well-being, people react to events but then return to baseline levels of happiness and satisfaction over time. We tested this idea by examining reaction and adaptation to unemployment in a 15-year longitudinal study of more than 24,000 individuals living in Germany. In accordance with set-point theories, individuals reacted strongly to unemployment and then shifted back toward their baseline levels of life satisfaction. However, on average, individuals did not completely return to their former levels of satisfaction, even after they became reemployed. Furthermore, contrary to expectations from adaptation theories, people who had experienced unemployment in the past did not react any less negatively to a new bout of unemployment than did people who had not been previously unemployed. These results suggest that although life satisfaction is moderately stable over time, life events can have a strong influence on long-term levels of subjective well-being.


title: Towards an intelligent textbook: eye gaze based attention extraction on materials for learning and instruction in physics

text: In this paper, we propose the attention extraction method on a textbook of physics by using eye tracking glasses. We prepare a document including text and tasks in physics, and record reading behavior on the document from 6-grade students. The result confirms that students pay attention to a different region depending on situations (using the text as a material to learn the content, or using it as hints to solve tasks) and their comprehension.


title: A single-phase grid-connected PV converter with minimal DC-link capacitor and low-frequency ripple-free maximum power point tracking

text: This paper presents a novel single-phase grid-connected photovoltaic (PV) converter based on current-fed dual active bridge (CF-DAB) dc-dc converter. The proposed converter allows a minimal DC-link capacitor with large voltage variation without low-frequency effect on maximum power point tracking (MPPT). An advanced control system is developed based on the converter operation principles. Minimized transformer peak current is capable to be achieved through a symmetrical dc voltage control. Simulation results are presented to validate the performance of the proposed PV converter. A 5kW laboratorial prototype is also implemented and the results will be presented later.


title: DeepV2D: Video to Depth with Differentiable Structure from Motion

text: We propose DeepV2D, an end-to-end differentiable deep learning architecture for predicting depth from a video sequence. We incorporate elements of classical Structure from Motion into an end-to-end trainable pipeline by designing a set of differentiable geometric modules. Our full system alternates between predicting depth and refining camera pose. We estimate depth by building a cost volume over learned features and apply a multi-scale 3D convolutional network for stereo matching. The predicted depth is then sent to the motion module which performs iterative pose updates by mapping optical flow to a camera motion update. We evaluate our proposed system on NYU, KITTI, and SUN3D datasets and show improved results over monocular baselines and deep and classical stereo reconstruction.


title: Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle

text: This article introduces Periodically Controlled Hybrid Automata (PCHA) for modular specification of embedded control systems. In a PCHA, control actions that change the control input to the plant occur roughly periodically, while other actions that update the state of the controller may occur in the interim. Such actions could model, for example, sensor updates and information received from higher-level planning modules that change the set point of the controller. Based on periodicity and subtangential conditions, a new sufficient condition for verifying invariant properties of PCHAs is presented. For PCHAs with polynomial continuous vector fields, it is possible to check these conditions automatically using, for example, quantifier elimination or sum of squares decomposition. We examine the feasibility of this automatic approach on a small example. The proposed technique is also used to manually verify safety and progress properties of a fairly complex planner-controller subsystem of an autonomous ground vehicle. Geometric properties of planner-generated paths are derived which guarantee that such paths can be safely followed by the controller.


title: Prediction of Student Academic Performance by an Application of K-Means Clustering Algorithm

text: Data Clustering is used to extract meaningful information and to develop significant relationships among variables stored in large data set/data warehouse. In this paper data clustering technique named k-means clustering is applied to analyze student’s learning behavior. The student’s evaluation factor like class quizzes, mid and final exam assignment are studied. It is recommended that all these correlated information should be conveyed to the class advisor before the conduction of final exam. This study will help the teachers to reduce the drop out ratio to a significant level and improve the performance of students.


title: Scalable Realistic Rendering with Many-Light Methods

text: Recent years have seen increasing attention and significant progress in many-light rendering, a class of methods for the efficient computation of global illumination. The many-light formulation offers a unified mathematical framework for the problem reducing the full lighting transport simulation to the calculation of the direct illumination from many virtual light sources. These methods are unrivaled in their scalability: they are able to produce artifact-free images in a fraction of a second but also converge to the full solution over time. In this state-of-the-art report, we have three goals: give an easy-to-follow, introductory tutorial of many-light theory; provide a comprehensive, unified survey of the topic with a comparison of the main algorithms; and present a vision to motivate and guide future research. We will cover both the fundamental concepts as well as improvements, extensions, and applications of many-light rendering.


title: Accelerated training of conditional random fields with stochastic gradient methods

text: We apply Stochastic Meta-Descent (SMD), a stochastic gradient optimization method with gain vector adaptation, to the training of Conditional Random Fields (CRFs). On several large data sets, the resulting optimizer converges to the same quality of solution over an order of magnitude faster than limited-memory BFGS, the leading method reported to date. We report results for both exact and inexact inference techniques.


title: HURRICANE TRAJECTORY PREDICTION VIA A SPARSE RECURRENT NEURAL NETWORK

text: A proposed sparse recurrent neural network with flexible topology is used for trajectory prediction of the Atlantic hurricanes. For prediction of the future trajectories of a target hurricane, the most similar hurricanes to the target hurricane are found by comparing directions of the hurricanes. Then, the first and second differences of their positions over their life time are used for training the proposed network. Comparison of the obtained predictions with actual trajectories of Sandy and Humberto hurricanes show that our approach is quite promising for this aim.


title: Mindful consumption : a customer-centric approach to sustainability

text: How effectively business deals with the challenges of sustainability will define its success for decades to come. Current sustainability strategies have three major deficiencies: they do not directly focus on the customer, they do not recognize the looming threats from rising global over-consumption, and they do not take a holistic approach. We present a framework for a customer-centric approach to sustainability. This approach recasts the sustainability metric to emphasize the outcomes of business actions measured holistically in term of environmental, personal and economic well-being of the consumer. We introduce the concept of mindful consumption (MC) as the guiding principle in this approach. MC is premised on a consumer mindset of caring for self, for community, and for nature, that translates behaviorally into tempering the selfdefeating excesses associated with acquisitive, repetitive and aspirational consumption. We also make the business case for fostering mindful consumption, and illustrate how the marketing function can be harnessed to successfully implement the customer-centric approach to sustainability.


title: Quality-biased ranking for queries with commercial intent

text: Modern search engines are good enough to answer popular commercial queries with mainly highly relevant documents. However, our experiments show that users behavior on such relevant commercial sites may differ from one to another web-site with the same relevance label. Thus search engines face the challenge of ranking results that are equally relevant from the perspective of the traditional relevance grading approach. To solve this problem we propose to consider additional facets of relevance, such as trustability, usability, design quality and the quality of service. In order to let a ranking algorithm take these facets in account, we proposed a number of features, capturing the quality of a web page along the proposed dimensions. We aggregated new facets into the single label, commercial relevance, that represents cumulative quality of the site. We extrapolated commercial relevance labels for the entire learning-to-rank dataset and used weighted sum of commercial and topical relevance instead of default relevance labels. For evaluating our method we created new DCG-like metrics and conducted off-line evaluation as well as on-line interleaving experiments demonstrating that a ranking algorithm taking the proposed facets of relevance into account is better aligned with user preferences.


title: Scalable Graph Exploration on Multicore Processors

text: Many important problems in computational sciences, social network analysis, security, and business analytics, are data-intensive and lend themselves to graph-theoretical analyses. In this paper we investigate the challenges involved in exploring very large graphs by designing a breadth-first search (BFS) algorithm for advanced multi-core processors that are likely to become the building blocks of future exascale systems. Our new methodology for large-scale graph analytics combines a highlevel algorithmic design that captures the machine-independent aspects, to guarantee portability with performance to future processors, with an implementation that embeds processorspecific optimizations. We present an experimental study that uses state-of-the-art Intel Nehalem EP and EX processors and up to 64 threads in a single system. Our performance on several benchmark problems representative of the power-law graphs found in real-world problems reaches processing rates that are competitive with supercomputing results in the recent literature. In the experimental evaluation we prove that our graph exploration algorithm running on a 4-socket Nehalem EX is (1) 2.4 times faster than a Cray XMT with 128 processors when exploring a random graph with 64 million vertices and 512 millions edges, (2) capable of processing 550 million edges per second with an R-MAT graph with 200 million vertices and 1 billion edges, comparable to the performance of a similar graph on a Cray MTA-2 with 40 processors and (3) 5 times faster than 256 BlueGene/L processors on a graph with average degree 50.


title: Thirteen Ways to Look at the Correlation Coefficient

text: Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://dv1litvip.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.


title: Unicorn: A System for Searching the Social Graph

text: Unicorn is an online, in-memory social graph-aware indexing system designed to search trillions of edges between tens of billions of users and entities on thousands of commodity servers. Unicorn is based on standard concepts in information retrieval, but it includes features to promote results with good social proximity. It also supports queries that require multiple round-trips to leaves in order to retrieve objects that are more than one edge away from source nodes. Unicorn is designed to answer billions of queries per day at latencies in the hundreds of milliseconds, and it serves as an infrastructural building block for Facebook’s Graph Search product. In this paper, we describe the data model and query language supported by Unicorn. We also describe its evolution as it became the primary backend for Facebook’s search offerings.


title: The anatomy of a large-scale social search engine

text: We present Aardvark, a social search engine. With Aardvark, users ask a question, either by instant message, email, web input, text message, or voice. Aardvark then routes the question to the person in the user's extended social network most likely to be able to answer that question. As compared to a traditional web search engine, where the challenge lies in finding the right document to satisfy a user's information need, the challenge in a social search engine like Aardvark lies in finding the right person to satisfy a user's information need. Further, while trust in a traditional search engine is based on authority, in a social search engine like Aardvark, trust is based on intimacy. We describe how these considerations inform the architecture, algorithms, and user interface of Aardvark, and how they are reflected in the behavior of Aardvark users.


title: Bidirectional Expansion For Keyword Search on Graph Databases

text: Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on such graphs has received much attention lately. A central problem in this scenario is to efficiently extract from the data graph a small number of the “best” answer trees. A Backward Expanding search, starting at nodes matching keywords and working up toward confluent roots, is commonly used for predominantly text-driven queries. But it can perform poorly if some keywords match many nodes, or some node has very large degree. In this paper we propose a new search algorithm, Bidirectional Search, which improves on Backward Expanding search by allowing forward search from potential roots towards leaves. To exploit this flexibility, we devise a novel search frontier prioritization technique based on spreading activation. We present a performance study on real data, establishing that Bidirectional Search significantly outperforms Backward Expanding search.


title: A comparative study of game mechanics and control laws for an adaptive physiological game

text: We present an adaptive biofeedback game that aims to maintain the player’s arousal by modifying game difficulty in response to the player’s physiological state, as measured with wearable sensors. Our approach models the interaction between human physiology and game difficulty during gameplay as a control problem, where game difficulty is the system input and player arousal its output. We validate the approach on a car-racing game with real-time adaptive game mechanics. Specifically, we use (1) car speed, road visibility, and steering jitter as three mechanisms to manipulate game difficulty, (2) electrodermal activity as physiological correlate of arousal, and (3) two types of control law: proportional (P) control, and proportional-integral-derivative (PID) control. We also propose quantitative measures to characterize the effectiveness of these game adaptations and controllers in manipulating the player’s arousal. Experimental trials with 25 subjects in both open-loop (no feedback) and closed-loop (negative feedback) conditions show statistically significant differences in effectiveness among the three game mechanics and also between the two control laws. Specifically, manipulating car speed provides higher control of arousal levels than changing road visibility or vehicle steering. Our results also confirm that PID control leads to lower error and reduced oscillations in the closed-loop response compared to proportional-only control. Finally, we discuss the theoretical and practical implications of our approach.


title: A summary-statistic representation in peripheral vision explains visual crowding.

text: Peripheral vision provides a less faithful representation of the visual input than foveal vision. Nonetheless, we can gain a lot of information about the world from our peripheral vision, for example in order to plan eye movements. The phenomenon of crowding shows that the reduction of information available in the periphery is not merely the result of reduced resolution. Crowding refers to visual phenomena in which identification of a target stimulus is significantly impaired by the presence of nearby stimuli, or flankers. What information is available in the periphery? We propose that the visual system locally represents peripheral stimuli by the joint statistics of responses of cells sensitive to different position, phase, orientation, and scale. This "textural" representation by summary statistics predicts the subjective "jumble" of features often associated with crowding. We show that the difficulty of performing an identification task within a single pooling region using this representation of the stimuli is correlated with peripheral identification performance under conditions of crowding. Furthermore, for a simple stimulus with no flankers, this representation can be adequate to specify the stimulus with some position invariance. This provides evidence that a unified neuronal mechanism may underlie peripheral vision, ordinary pattern recognition in central vision, and texture perception. A key component of our methodology involves creating visualizations of the information available in the summary statistics of a stimulus. We call these visualizations "mongrels" and show that they are highly useful in examining how the early visual system represents the visual input. Mongrels enable one to study the "equivalence classes" of our model, i.e., the sets of stimuli that map to the same representation according to the model.


title: Enhancing SDN security for IoT-related deployments through blockchain

text: The majority of business activity of our integrated and connected world takes place in networks based on cloud computing infrastructure that cross national, geographic and jurisdictional boundaries. Such an efficient entity interconnection is made possible through an emerging networking paradigm, Software Defined Networking (SDN) that intends to vastly simplify policy enforcement and network reconfiguration in a dynamic manner. However, despite the obvious advantages this novel networking paradigm introduces, its increased attack surface compared to traditional networking deployments proved to be a thorny issue that creates skepticism when safety-critical applications are considered. Especially when SDN is used to support Internet-of-Things (IoT)-related networking elements, additional security concerns rise, due to the elevated vulnerability of such deployments to specific types of attacks and the necessity of inter-cloud communication any IoT application would require. The overall number of connected nodes makes the efficient monitoring of all entities a real challenge, that must be tackled to prevent system degradation and service outage. This position paper provides an overview of common security issues of SDN when linked to IoT clouds, describes the design principals of the recently introduced Blockchain paradigm and advocates the reasons that render Blockchain as a significant security factor for solutions where SDN and IoT are involved.


title: Measuring Negative and Positive Thoughts in Children: An Adaptation of the Children’s Automatic Thoughts Scale (CATS)

text: The aim of this study is to describe the factor structure and psychometric properties of an extended version of the Children’s Automatic Thoughts Scale (CATS), the CATS-Negative/Positive (CATS-N/P). The CATS was originally designed to assess negative self-statements in children and adolescents. However, positive thoughts also play a major role in childhood disorders such as anxiety and depression. Therefore, positive self-statements were added to the CATS. The CATS-N/P was administered to a community sample of 554 children aged 8–18 years. The results of a confirmatory factor analysis revealed that the positive self-statements formed a separate and psychometrically sound factor. Internal and short-term test–retest reliability was good. Boys reported more hostile and positive thoughts than girls; and younger children reported more negative thoughts concerning physical threat, social threat, and failure than older children. In conclusion, the results of the current study support the use of the CATS-N/P for the measurement of positive and negative thoughts in children. The application of the CATS-N/P can facilitate further research on cognitive factors in different childhood disorders.


title: MODIFIED MULTILOOK CROSS CORRELATION ( MLCC ) ALGORITHM FOR DOPPLER CENTROID ESTIMATION IN SYNTHETIC APERTURE RADAR SIGNAL PROCESS -

text: The Multilook Cross Correlation (MLCC) is one of the most reliable algorithms used for Doppler ambiguity number estimation of the Doppler centroid parameter. However, the existing MLCC algorithm is only suitable for low contrast scenes. In high contrast scenes, the estimated result is not reliable, and the error is unacceptable. Besides, the Doppler centroid estimation processing time is long and can only be used in offline processing. In this paper, we introduce a modified MLCC algorithm that has better sensitivity which is suitable not only for low contrast scenes, but also for high contrast scenes. In addition, the modified MLCC algorithm can be implemented on parallel signal processing units for better time efficiency. Experiments with RADARSAT-1 data show that the modified algorithm works well in both high and low contrast scenes.


title: Author ' s personal copy A new hybrid arti fi cial neural networks for rainfall – runoff process modeling

text: This paper proposes a hybrid intelligent model for runoff prediction. The proposed model is a combination of data preprocessing methods, genetic algorithms and levenberg–marquardt (LM) algorithm for learning feed forward neural networks. Actually it evolves neural network initial weights for tuning with LM algorithm by using genetic algorithm. We also use data pre-processing methods such as data transformation, input variables selection and data clustering for improving the accuracy of the model. The capability of the proposed method is tested by applying it to predict runoff at the Aghchai watershed. The results show that this approach is able to predict runoff more accurately than Artificial Neural Network (ANN) and Adaptive Neuro Fuzzy Inference System (ANFIS) models. & 2013 Elsevier B.V. All rights reserved.


title: Evaluating the Effect of Total Quality Management Practices on Business Performance : A Study of Manufacturing Firms of Pakistan

text: The present study has evaluated the effect of TQM practices on business performance of manufacturing firms in Pakistan. A sample of 65 managers working in the quality assurance department was taken from these manufacturing firms and their responses were collected using a structured questionnaire. Descriptive statistics were used to demonstrate the effect of different levels of TQM practices on business performance in terms of financial performance, product quality performance, customer satisfaction. The study had also considered organizational level variables like size of firm, year of existence, top management commitment as moderating variables, the results have shown that TQM was implemented only at the first three levels i.e. quality control ,quality assurance and continuous improvement in the selected firms and that top management commitment is the most important variable effecting on TQM implementation which then directly effect on business performance in these manufacturing firms.


title: Food Balance Estimation by Using Personal Dietary Tendencies in a Multimedia Food Log

text: We have investigated the “FoodLog” multimedia food-recording tool, whereby users upload photographs of their meals and a food diary is constructed using image-processing functions such as food-image detection and food-balance estimation. In this paper, following a brief introduction to FoodLog, we propose a Bayesian framework that makes use of personal dietary tendencies to improve both food-image detection and food-balance estimation. The Bayesian framework facilitates incremental learning. It incorporates three personal dietary tendencies that influence food analysis: likelihood, prior distribution, and mealtime category. In the evaluation of the proposed method using images uploaded to FoodLog, both food-image detection and food-balance estimation are improved. In particular, in the food-balance estimation, the mean absolute error is significantly reduced from 0.69 servings to 0.28 servings on average for two persons using more than 200 personal images, and 0.59 servings to 0.48 servings on average for four persons using 100 personal images. Among the works analyzing food images, this is the first to make use of statistical personal bias to improve the performance of the analysis.


title: IoT in Agriculture: Designing a Europe-Wide Large-Scale Pilot

text: The technologies associated with the Internet of Things have great potential for application in the domain of food and agriculture, especially in view of the societal and environmental challenges faced by this sector. From farm to fork, IoT technologies could transform the sector, contributing to food safety, and the reduction of agricultural inputs and food waste. A major step toward greater uptake of these technologies will be the execution of IoT-based large-scale pilots (LSPs) in the entire supply chain. This article outlines the challenges and constraints that an LSP deployment of IoT in this domain must consider. Sectoral and technological challenges are described in order to identify a set of technological and agrifood requirements. An architecture based on a system of systems approach is briefly presented, the importance of addressing the interoperability challenges faced by this sector is highlighted, and we elaborate on requirements for new business models, security, privacy, and data governance. A description of the technologies and solutions involved in designing pilots for four agrifood domains (dairy, fruit, arable, meat and vegetable supply chain) is eventually provided. In conclusion, it is noted that for IoT to be successful in this domain, a significant change of culture is needed.


title: Tapping the power of text mining

text: Sifting through vast collections of unstructured or semistructured data beyond the reach of data mining tools, text mining tracks information sources, links isolated concepts in distant documents, maps relationships between activities, and helps answer questions.


title: Designed Interdependence, Growing Social Capital and Knowledge Sharing in IS Project Teams

text: This study brings in the task interdependence as the antecedent for growing team social capital and increasing knowledge sharing among team members in IS project context in which heterogeneous members need to interact very closely. Data collected from 203 IS projects largely confirm the proposed research model. Between the task interdependence and team performance, the team social capital as well as the knowledge sharing among members fully mediates the relationship. Interestingly, direct path from task interdependence onto performance is found to be insignificant, rebutting the suggestions of the work design theory which says well designed interdependence directly increase performance in heterogeneous teams. Findings of our study signify the criticality of the mediating roles of social capital and knowledge sharing. Additionally, it is also confirmed that the social capital grows with time. Also, longer term projects revealed a bit different mechanism than shorter ones. Implications are discussed with limitations and further studies.


title: BAG: Managing GPU as Buffer Cache in Operating Systems

text: This paper presents the design, implementation and evaluation of BAG, a system that manages GPU as the buffer cache in operating systems. Unlike previous uses of GPUs, which have focused on the computational capabilities of GPUs, BAG is designed to explore a new dimension in managing GPUs in heterogeneous systems where the GPU memory is an exploitable but always ignored resource. With the carefully designed data structures and algorithms, such as concurrent hashtable, log-structured data store for the management of GPU memory, and highly-parallel GPU kernels for garbage collection, BAG achieves good performance under various workloads. In addition, leveraging the existing abstraction of the operating system not only makes the implementation of BAG non-intrusive, but also facilitates the system deployment.


title: Packaging a $W$ -Band Integrated Module With an Optimized Flip-Chip Interconnect on an Organic Substrate

text: This paper, for the first time, presents successful integration of a W-band antenna with an organically flip-chip packaged silicon-germanium (SiGe) low-noise amplifier (LNA). The successful integration requires an optimized flip-chip interconnect. The interconnect performance was optimized by modeling and characterizing the flip-chip transition on a low-loss liquid crystal polymer organic substrate. When the loss of coplanar waveguide (CPW) lines is included, an insertion loss of 0.6 dB per flip-chip-interconnect is measured. If the loss of CPW lines is de-embedded, 0.25 dB of insertion loss is observed. This kind of low-loss flip-chip interconnect is essential for good performance of W-band modules. The module, which we present in this paper, consists of an end-fire Yagi-Uda antenna integrated with an SiGe BiCMOS LNA. The module is 3 mm × 1.9 mm and consumes only 19.2 mW of dc power. We present passive and active E- and H-plane radiation pattern measurements at 87, 90, and 94 GHz. Passive and active antennas both showed a 10-dB bandwidth of 10 GHz. The peak gain of passive and active antennas was 5.2 dBi at 90 GHz and 21.2 dBi at 93 GHz, respectively. The measurements match well with the simulated results.


title: End-to-End Joint Semantic Segmentation of Actors and Actions in Video

text: Traditional video understanding tasks include human action recognition and actor/object semantic segmentation. However, the combined task of providing semantic segmentation for different actor classes simultaneously with their action class remains a challenging but necessary task for many applications. In this work, we propose a new end-to-end architecture for tackling this task in videos. Our model effectively leverages multiple input modalities, contextual information, and multitask learning in the video to directly output semantic segmentations in a single unified framework. We train and benchmark our model on the Actor-Action Dataset (A2D) for joint actor-action semantic segmentation, and demonstrate state-of-the-art performance for both segmentation and detection. We also perform experiments verifying our approach improves performance for zero-shot recognition, indicating generalizability of our jointly learned feature space.


title: Comparison of Longley-Rice, ITM and ITWOM propagation models for DTV and FM broadcasting

text: With the rapid deployment of digital TV, there is an increasing need for accurate point-to-area prediction tools. There is a great deal of propagation models for coverage prediction of DTV. Some of them are pure empirical models, and others are mixed, empirical-analytical models, based on measurement campaigns and electromagnetic theory. The aim of this paper is to compare accurate measurements taken by a Rohde & Schwarz FSH-3 portable spectrum analyzer and precision antennas (biconical and log-periodic), with simulation results derived from coverage prediction models, like the NTIA-ITS Longley-Rice model, the ITM (Irregular Terrain Model) using the 3-arc-second SRTM (Satellite Radar Topography Mission) data that is available freely, and the newer ITWOM (Irregular Terrain with Obstructions Model) model which combines equations from ITU-R P.1546 model with Beer's law and Snell's law. Furthermore, measurements for analog FM broadcasting are compared to predictions from the above mentioned models.


title: iDocChip: A Configurable Hardware Architecture for Historical Document Image Processing: Percentile Based Binarization

text:
End-to-end Optical Character Recognition (OCR) systems are heavily used to convert document images into machine-readable text. Commercial and open-source OCR systems (like Abbyy, OCRopus, Tesseract etc.) have traditionally been optimized for contemporary documents like books, letters, memos, and other end-user documents. However, these systems are difficult to use equally well for digitizing historical document images, which contain degradations like non-uniform shading, bleed-through, and irregular layout; such degradations usually do not exist in contemporary document images.
 The open-source anyOCR is an end-to-end OCR pipeline, which contains state-of-the-art techniques that are required for digitizing degraded historical archives with high accuracy. However, high accuracy comes at a cost of high computational complexity that results in 1) long runtime that limits digitization of big collection of historical archives and 2) high energy consumption that is the most critical limiting factor for portable devices with constrained energy budget. Therefore, we are targeting energy efficient and high throughput acceleration of the anyOCR pipeline. Generalpurpose computing platforms fail to meet these requirements that makes custom hardware design mandatory. In this paper, we are presenting a new concept named iDocChip. It is a portable hybrid hardware-software FPGA-based accelerator that is characterized by low footprint meaning small size, high power efficiency that will allow using it in portable devices, and high throughput that will make it possible to process big collection of historical archives in real time without effecting the accuracy.
 In this paper, we focus on binarization, which is the second most critical step in the anyOCR pipeline after text-line recognizer that we have already presented in our previous publication [21]. The anyOCR system makes use of a Percentile Based Binarization method that is suitable for overcoming degradations like non-uniform shading and bleed-through. To the best of our knowledge, we propose the first hardware architecture of the PBB technique. Based on the new architecture, we present a hybrid hardware-software FPGA-based accelerator that outperforms the existing anyOCR software implementation running on i7-4790T in terms of runtime by factor of 21, while achieving energy efficiency of 10 Images/J that is higher than that achieved by low power embedded processors with negligible loss of recognition accuracy.


title: Architecture Technical Debt: Understanding Causes and a Qualitative Model

text: A known problem in large software companies is to balance the prioritization of short-term with long-term responsiveness. Specifically, architecture violations (Architecture Technical Debt) taken to deliver fast might hinder future feature development, which would hinder agility. We conducted a multiple-case embedded case study in 7 sites at 5 large companies in order to shed light on the current causes for the accumulation of Architectural Technical Debt that causes effort. We provide a taxonomy of the factors and their influence in the accumulation of debt, and we provide a qualitative model of how the debt is accumulated and recovered over time.


title: E-S-QUAL A Multiple-Item Scale for Assessing Electronic Service Quality

text: Using the means-end framework as a theoretical foundation, this article conceptualizes, constructs, refines, and tests a multiple-item scale (E-S-QUAL) for measuring the service quality delivered by Web sites on which customers shop online. Two stages of empirical data collection revealed that two different scales were necessary for capturing electronic service quality. The basic E-S-QUAL scale developed in the research is a 22-item scale of four dimensions: efficiency, fulfillment, system availability, and privacy. The second scale, E-RecS-QUAL, is salient only to customers who had nonroutine encounters with the sites and contains 11 items in three dimensions: responsiveness, compensation, and contact. Both scales demonstrate good psychometric properties based on findings from a variety of reliability and validity tests and build on the research already conducted on the topic. Directions for further research on electronic service quality are offered. Managerial implications stemming from the empirical findings about E-S-QUAL are also discussed.


title: Visual Analysis of Large Graphs

text: The analysis of large graphs plays a prominent role in various fields of research and is relevant in many important application areas. Effective visual analysis of graphs requires appropriate visual presentations in combination with respective user interaction facilities and algorithmic graph analysis methods. How to design appropriate graph analysis systems depends on many factors, including the type of graph describing the data, the analytical task at hand, and the applicability of graph analysis methods. The most recent surveys of graph visualization and navigation techniques were presented by Herman et al. [HMM00] and Diaz [DPS02]. The first work surveyed the main techniques for visualization of hierarchies and graphs in general that had been introduced until 2000. The second work concentrated on graph layouts introduced until 2002. Recently, new techniques have been developed covering a broader range of graph types, such as time-varying graphs. Also, in accordance with ever growing amounts of graph-structured data becoming available, the inclusion of algorithmic graph analysis and interaction techniques becomes increasingly important. In this State-of-the-Art Report, we survey available techniques for the visual analysis of large graphs. Our review firstly considers graph visualization techniques according to the type of graphs supported. The visualization techniques form the basis for the presentation of interaction approaches suitable for visual graph exploration. As an important component of visual graph analysis, we discuss various graph algorithmic aspects useful for the different stages of the visual graph analysis process.


title: Internet Banking Adoption Among Young Intellectuals

text: The aim of this paper is to study technology acceptance of internet banking among undergraduate students in Malaysia. Thus, the theoretical framework of the paper is based on modified version of Technology Acceptance Model (TAM). This paper develops a technology acceptance model for internet banking, a conceptual framework to explain the factors influencing undergraduate students' acceptance of internet banking. The model employs perceived usefulness (PU), perceived ease of use (PEOU), perceived credibility (PC) and computer self-efficacy (CSE). The first two are two initial constructs for TAM model. The rest are new constructs to be included in the model in order to have an extension of TAM model that better reflects the students’ view. The results suggest that PU, PEOU and PC had a significant relationship with behavioral intention. Further, these measures are good determinant for undergraduate acceptance for internet banking. Results also suggest that PU and PEOU had a significant relationship with CSE. On the contrary, CSE did not associate with PC. Also, PEOU had JIBC December 2007, Vol. 12, No. 3 2 a significant relationship with PU and PC that indicate these scales are related to PEOU in explaining undergraduate preference. The paper is useful in providing the understanding of the TAM among undergraduate from Malaysians’ perspective.


title: Best Practices for Data Centers : Lessons Learned from Benchmarking 22 Data Centers

text: Over the past few years, the authors benchmarked 22 data center buildings. From this effort, we have determined that data centers can be over 40 times as energy intensive as conventional office buildings. Studying the more efficient of these facilities enabled us to compile a set of “best-practice” technologies for energy efficiency. These best practices include: improved air management, emphasizing control and isolation of hot and cold air streams; rightsizing central plants and ventilation systems to operate efficiently both at inception and as the data center load increases over time; optimized central chiller plants, designed and controlled to maximize overall cooling plant efficiency, central air-handling units, in lieu of distributed units; “free cooling” from either air-side or water-side economizers; alternative humidity control, including elimination of control conflicts and the use of direct evaporative cooling; improved uninterruptible power supplies; high-efficiency computer power supplies; on-site generation combined with special chillers for cooling using the waste heat; direct liquid cooling of racks or computers; and lowering the standby losses of standby generation systems. Other benchmarking findings include power densities from 5 to nearly 100 Watts per square foot; though lower than originally predicted, these densities are growing. A 5:1 variation in cooling effectiveness index (ratio of cooling power to computer power) was found, as well as large variations in power distribution efficiency and overall center performance (ratio of computer power to total building power). These observed variations indicate the potential of energy savings achievable through the implementation of best practices in the design and operation of data centers. The Data Center Challenge The energy used by a typical rack of state-of-the art servers, drawing 20 kilowatts of power at 10 cents per kWh, uses more that $17,000 per year in electricity. Given that data centers can hold hundreds of such racks, they constitute a very energy-intensive building type. Clearly, efforts to improve energy efficiency in data centers can pay big dividends. But, where to start? “You can’t manage what you don’t measure” is a mantra often recited by corporate leaders (Tschudi et al 2005). Similarly, the high-availability needs of data center facilities can be efficiently met using this philosophy. This paper presents a selected distillation of the extensive benchmarking in 22 data centers which formed the basis for the development of 10 best-practice guides for design and operation that summarized how better energy performance was obtained in these actual facilities (LBNL 2006). With typical annual energy costs per square foot 15 times (and in some cases over 40 times) that of typical office buildings, data centers are an important target for energy savings. They operate continuously, which means that their electricity demand is always contributing to 3-76 © 2006 ACEEE Summer Study on Energy Efficiency in Buildings peak utility system demands, an important fact given that utility pricing increasingly reflects time-dependent tariffs. Energy-efficiency best practices can realize significant energy and peakpower savings while maintaining or improving reliability, and yield other non-energy benefits. Data centers ideally are buildings built primarily for computer equipment: to house it and provide power and cooling to it. They can also be embedded in other buildings including highrise office buildings. In any event, a useful metric to help gauge the energy efficiency of the data center is the computer power consumption index, or the fraction of the total data center power (including computers, power conditioning, HVAC, lighting, and miscellaneous) to that used by the computers (higher is better; a realistic maximum is in the 0.8 to 0.9 range, depending on climate). As shown in Figure 1, this number varies by more than a factor of 2 from the worst centers to the best we’ve benchmarked to date. Even the best have room for improvement, suggesting that many centers have tremendous opportunities for greater energy efficiency. Figure 1. Computer Power Consumption Index Computer Power Consumption Index


title: Mesofluidic actuation for articulated finger and hand prosthetics

text: The loss of fingers and hands severely limits career and lifestyle options for the amputee. Unfortunately, while there have been strides made in advancements of upper arm and leg prosthetics, the state of the art in prosthetic hands is lagging far behind. Options are generally limited to claw like devices that provide limited gripping capacity. The overall objective of this paper is to demonstrate a path towards a low-cost prosthetic hand with multiple articulated fingers and a thumb that rivals the human hand in terms of weight, size, dexterity, range of motion, force carrying capacity and speed. We begin with a description of the functional requirements for a human hand. When comparing requirements with actuation technologies, the fluid power approach has the potential to realize a prosthetic hand that rivals a human hand in size, strength and dexterity. We introduce a new actuation technology, mesofluidics, that focuses on miniaturization of fluid power to the meso-scale (mm to cm). As a novel demonstration of the potential for this technology, we describe a proof-of-principle mesofluidic finger that has intrinsic actuation and control (actuators and control valves within the volume of the finger). This finger weighs 63 grams, is sized to the 50th percentile male finger, has a total of 25 mechanical parts and is capable of providing 10 kg (22 lbs) of pinch force.


title: A Learning-Based Framework for Velocity Control in Autonomous Driving

text: We present a framework for autonomous driving which can learn from human demonstrations, and we apply it to the longitudinal control of an autonomous car. Offline, we model car-following strategies from a set of example driving sequences. Online, the model is used to compute accelerations which replicate what a human driver would do in the same situation. This reference acceleration is tracked by a predictive controller which enforces a set of comfort and safety constraints before applying the final acceleration. The controller is designed to be robust to the uncertainty in the predicted motion of the preceding vehicle. In addition, we estimate the confidence of the driver model predictions and use it in the cost function of the predictive controller. As a result, we can handle cases where the training data used to learn the driver model does not provide sufficient information about how a human driver would handle the current driving situation. The approach is validated using a combination of simulations and experiments on our autonomous vehicle.


title: Challenges in Autonomous Vehicle Testing and Validation

text: Software testing is all too often simply a bug hunt rather than a wellconsidered exercise in ensuring quality. A more methodical approach than a simple cycle of system-level test-fail-patch-test will be required to deploy safe autonomous vehicles at scale. The ISO 26262 development V process sets up a framework that ties each type of testing to a corresponding design or requirement document, but presents challenges when adapted to deal with the sorts of novel testing problems that face autonomous vehicles. This paper identifies five major challenge areas in testing according to the V model for autonomous vehicles: driver out of the loop, complex requirements, non-deterministic algorithms, inductive learning algorithms, and failoperational systems. General solution approaches that seem promising across these different challenge areas include: phased deployment using successively relaxed operational scenarios, use of a monitor/actuator pair architecture to separate the most complex autonomy functions from simpler safety functions, and fault injection as a way to perform more efficient edge case testing. While significant challenges remain in safety-certifying the type of algorithms that provide high-level autonomy themselves, it seems within reach to instead architect the system and its accompanying design process to be able to employ existing software safety approaches.


title: A machine learning approach for personalized autonomous lane change initiation and control

text: We study an algorithm that allows a vehicle to autonomously change lanes in a safe but personalized fashion without the driver's explicit initiation (e.g. activating the turn signals). Lane change initiation in autonomous driving is typically based on subjective rules, functions of the positions and relative velocities of surrounding vehicles. This approach is often arbitrary, and not easily adapted to the driving style preferences of an individual driver. Here we propose a data-driven modeling approach to capture the lane change decision behavior of human drivers. We collect data with a test vehicle in typical lane change situations and train classifiers to predict the instant of lane change initiation with respect to the preferences of a particular driver. We integrate this decision logic into a model predictive control (MPC) framework to create a more personalized autonomous lane change experience that satisfies safety and comfort constraints. We show the ability of the decision logic to reproduce and differentiate between two lane changing styles, and demonstrate the safety and effectiveness of the control framework through simulations.


title: Kinematic and dynamic vehicle models for autonomous driving control design

text: We study the use of kinematic and dynamic vehicle models for model-based control design used in autonomous driving. In particular, we analyze the statistics of the forecast error of these two models by using experimental data. In addition, we study the effect of discretization on forecast error. We use the results of the first part to motivate the design of a controller for an autonomous vehicle using model predictive control (MPC) and a simple kinematic bicycle model. The proposed approach is less computationally expensive than existing methods which use vehicle tire models. Moreover it can be implemented at low vehicle speeds where tire models become singular. Experimental results show the effectiveness of the proposed approach at various speeds on windy roads.


title: Apprenticeship learning for motion planning with application to parking lot navigation

text: Motion and path-planning algorithms often use complex cost functions for both global navigation and local smoothing of trajectories. Obtaining good results typically requires carefully hand-engineering the trade-offs between different terms in the cost function. In practice, it is often much easier to demonstrate a few good trajectories. In this paper, we describe an efficient algorithm which - when given access to a few trajectory demonstrations - can automatically infer good trade-offs between the different costs. In our experiments, we apply our algorithm to the problem of navigating a robotic car in a parking lot.


title: Deep or shallow, NLP is breaking out

text: Neural net advances improve computers' language ability in many fields.


title: Long-Term Amnesia: A Review and Detailed Illustrative Case Study

text: Long-term amnesia is a slowly developing form of anterograde amnesia accompanied by retrograde amnesia of variable severity (Kapur, 1996; 1997) often associated with damage to the anterior temporal neocortex and epileptic seizures. The precise neural and functional deficits that underlie this condition are unknown. A patient, JL, who has this condition following a closed-head injury, is described in detail. Her injury caused bilateral anterior temporal neocortex damage that was more extensive on the left and right-sided damage to the perirhinal and orbitofrontal cortices. The hippocampus appeared to be intact bilaterally. Epilepsy developed within two years of JL's injury. Apart from her memory impairments, JL's cognitive functions, including high-level visual perception, attention, semantic memory and executive functions were well preserved. Her memory also seemed well preserved for at least 30 minutes following encoding. The one exception was the patient's relatively greater impairment at difficult visual recognition tests for which verbalization may not have been an effective strategy. This problem may have been caused by JL's right-sided perirhinal and orbitofrontal cortex damage. Her recall and recognition was clearly impaired after a three-week delay. She also showed a retrograde amnesia, which appeared to be milder than her remote post-morbid memory deficit. JL's remote memory was preserved for information first encountered in either the pre- or post-morbid period provided the information had received sufficient rehearsal over long periods of time. Her long-term amnesia may have been caused by anterior temporal neocortex damage, possibly in association with her epileptic seizures. Whether the condition is heterogeneous, involves a deficit in slow consolidation, disruption of unconsolidated memories, or blockage of maintenance or disruption of insufficiently rehearsed memories whether or not these have been slowly consolidated is discussed.


title: met*: A Method for Discriminating Matonymy and Metaphor by Computer

text: The met* method distinguishes selected examples of metonymy from metaphor and from literalness and anomaly in short English sentences. In the met* method, literalness is distinguished because it satisfies contextual constraints that the nonliteral others all violate. Metonymy is discriminated from metaphor and anomaly in a way that [1] supports Lakoff and Johnson's (1980) view that in metonymy one entity stands for another whereas in metaphor one entity is viewed as another, [2] permits chains of metonymies (Reddy 1979), and [3] allows metonymies to co-occur with instances of either literalness, metaphor, or anomaly. Metaphor is distinguished from anomaly because the former contains a relevant analogy, unlike the latter. The met* method is part of Collative Semantics, a semantics for natural language processing, and has been implemented in a computer program called meta5. Some examples of meta5's analysis of metaphor and metonymy are given. The met* method is compared with approaches from artificial intelligence, linguistics, philosophy, and psychology.


title: Genetic engineering of algae for enhanced biofuel production.

text: There are currently intensive global research efforts aimed at increasing and modifying the accumulation of lipids, alcohols, hydrocarbons, polysaccharides, and other energy storage compounds in photosynthetic organisms, yeast, and bacteria through genetic engineering. Many improvements have been realized, including increased lipid and carbohydrate production, improved H(2) yields, and the diversion of central metabolic intermediates into fungible biofuels. Photosynthetic microorganisms are attracting considerable interest within these efforts due to their relatively high photosynthetic conversion efficiencies, diverse metabolic capabilities, superior growth rates, and ability to store or secrete energy-rich hydrocarbons. Relative to cyanobacteria, eukaryotic microalgae possess several unique metabolic attributes of relevance to biofuel production, including the accumulation of significant quantities of triacylglycerol; the synthesis of storage starch (amylopectin and amylose), which is similar to that found in higher plants; and the ability to efficiently couple photosynthetic electron transport to H(2) production. Although the application of genetic engineering to improve energy production phenotypes in eukaryotic microalgae is in its infancy, significant advances in the development of genetic manipulation tools have recently been achieved with microalgal model systems and are being used to manipulate central carbon metabolism in these organisms. It is likely that many of these advances can be extended to industrially relevant organisms. This review is focused on potential avenues of genetic engineering that may be undertaken in order to improve microalgae as a biofuel platform for the production of biohydrogen, starch-derived alcohols, diesel fuel surrogates, and/or alkanes.


title: The use of time-variant EEG Granger causality for inspecting directed interdependencies of neural assemblies

text: Understanding of brain functioning requires the investigation of activated cortical networks, in particular the detection of interactions between different cortical sites. Commonly, coherence and correlation are used to describe interrelations between EEG signals. However, on this basis, no statements on causality or the direction of their interrelations are possible. Causality between two signals may be expressed in terms of upgrading the predictability of one signal by the knowledge of the immediate past of the other signal. The best-established approach in this context is the so-called Granger causality. The classical estimation of Granger causality requires the stationarity of the signals. In this way, transient pathways of information transfer stay hidden. The study presents an adaptive estimation of Granger causality. Simulations demonstrate the usefulness of the time-variant Granger causality for detecting dynamic causal relations within time intervals of less than 100 ms. The time-variant Granger causality is applied to EEG data from the Stroop task. It was shown that conflict situations generate dense webs of interactions directed from posterior to anterior cortical sites. The web of directed interactions occurs mainly 400 ms after the stimulus onset and lasts up to the end of the task.


title: An application-specific protocol architecture for wireless microsensor networks

text: In recent years advances in energy e cient design and wireless technologies have enabled exciting new applications for wireless devices These applications span a wide range including real time and streaming video and audio delivery remote monitoring using networked microsensors personal medical monitoring and home networking of everyday appliances While these applications require high performance from the network they su er from resource constraints that do not appear in more traditional wired computing environments In particular wireless spectrum is scarce often limiting the bandwidth available to applications and making the channel error prone and the nodes are battery operated often limiting available energy My thesis is that this harsh environment with severe resource constraints requires an application speci c protocol architecture rather than the traditional layered approach to obtain the best pos sible performance This dissertation supports this claim using detailed case studies on microsensor networks and wireless video delivery The rst study develops LEACH Low Energy Adaptive Clustering Hierarchy an architecture for remote microsensor networks that combines the ideas of energy e cient cluster based routing and media access together with application speci c data aggregation to achieve good performance in terms of system lifetime latency and application perceived quality This approach improves system lifetime by an order of magnitude compared to general purpose approaches when the node energy is limited The second study develops an unequal error protection scheme for MPEG compressed video delivery that adapts the level of protection applied to portions of a packet to the degree of importance of the corresponding bits This approach obtains better application perceived performance than current approaches for the same amount of transmission bandwidth These two systems show that application speci c protocol architectures achieve the energy and latency e ciency and error robustness needed for wireless networks Thesis Supervisor Anantha P Chandrakasan Title Associate Professor Thesis Supervisor Hari Balakrishnan Title Assistant Professor This thesis is dedicated to the memory of Robert H Rabiner The rst Rabiner at the Tute


title: 'Strong is the new skinny': A content analysis of #fitspiration images on Instagram.

text: 'Fitspiration' is an online trend designed to inspire viewers towards a healthier lifestyle by promoting exercise and healthy food. This study provides a content analysis of fitspiration imagery on the social networking site Instagram. A set of 600 images were coded for body type, activity, objectification and textual elements. Results showed that the majority of images of women contained only one body type: thin and toned. In addition, most images contained objectifying elements. Accordingly, while fitspiration images may be inspirational for viewers, they also contain a number of elements likely to have negative effects on the viewer's body image.


title: Service Science

text: This paper is a first exploration of the relationship between service science and Grid computing. Service science is the study of value co-creation interactions among entities, known as service systems. Within the emerging service science community, service is often defined as the application of competences (resources) for the benefit of another. Grid computing is the study of resource sharing among entities, known as virtual organizations, which solve complex business, societal, scientific, and engineering problems. Within the Grid computing community, service is sometimes defined as protocols plus behavior. Both Grid computing and service science are connecting academic, industry, government, and volunteer sector collaborators on a range of projects including eScience, healthcare, environmental sustainability, and more. This paper compares and contrasts the notions of resource, entity, service, interaction, and success criteria for the two areas of study. In conclusion, new areas for collaborative inquiry are proposed.


title: Global Changes and Drivers of the Water Footprint of Food Consumption : A Historical Analysis

text: Water is one of the most important limiting resources for food production. How much water is needed for food depends on the size of the population, average food consumption patterns and food production per unit of water. These factors show large differences around the world. This paper analyzes sub-continental dynamics of the water footprint of consumption (WFcons) for the prevailing diets from 1961 to 2009 using data from the Food and Agriculture Organization (FAO). The findings show that, in most regions, the water needed to feed one person decreased even if diets became richer, because of the increase in water use efficiency in food production during the past half-century. The logarithmic mean Divisia index (LMDI) decomposition approach is used to analyze the contributions of the major drivers of WFcons for food: population, diet and agricultural practices (output per unit of water). We compare the contributions of these drivers through different subcontinents, and find that population growth still was the major driver behind increasing WFcons for food until now and that potential water savings through agricultural practice improvements were offset by population growth and diet change. The changes of the factors mentioned above were the largest in most developing areas with rapid economic development. With the development of globalization, the international food trade has brought more and more water savings in global water use over time. The results indicate that, in the near future and in many regions, diet change is likely to override population growth as the major driver behind WFcons for food. OPEN ACCESS


title: Optimal Sink Deployment for Distributed Sensing of Spatially Nonstationary Phenomena

text: The optimal deployment of sinks in a sensor region for power efficient data gathering of a physical phenomenon is investigated in this work. In the system of consideration, nodes perform lossless distributed coding of the sensed data and the spatial statistics of the monitored phenomenon are possibly nonstationary due to heterogeneity in the sensing environment (e.g. variations in the altimetric profile). Non-stationary spatial statistics lead to uneven spatial profiles of the bit rates, unlike stationary statistics. The properties of rate profiles and the consequent optimal sink locations for a broad class of spatially non-stationary covariance models are studied by mathematical analysis and numerical examples.