Query: Analysis of human faces using a measurement-based skin reflectance model

Relevant passages:
Acquiring the reflectance field of a human face <=SEP=> We present a method to acquire the reflectance field of a human face and use these measurements to render the face under arbitrary changes in lighting and viewpoint. We first acquire images of the face from a small set of viewpoints under a dense sampling of incident illumination directions using a light stage. We then construct a reflectance function image for each observed image pixel from its values over the space of illumination directions. From the reflectance functions, we can directly generate images of the face from the original viewpoints in any form of sampled or computed illumination. To change the viewpoint, we use a model of skin reflectance to estimate the appearance of the reflectance functions for novel viewpoints. We demonstrate the technique with synthetic renderings of a person's face under novel illumination and viewpoints.

A Morphable Model for the Synthesis of 3D Faces <=SEP=> In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly through an intuitive user interface. Users are assisted in two key problems of computer aided face modeling. First, new face images or new 3D face models can be registered automatically by computing dense one-to-one correspondence to an internal face model. Second, the approach regulates the naturalness of modeled faces avoiding faces with an “unlikely” appearance. Starting from an example set of 3D face models, we derive a morphable face model by transforming the shape and texture of the examples into a vector space representation. New faces and expressions can be modeled by forming linear combinations of the prototypes. Shape and texture constraints derived from the statistics of our example faces are used to guide manual modeling or automated matching algorithms. We show 3D face reconstructions from single images and their applications for photo-realistic image manipulations. We also demonstrate face manipulations according to complex parameters such as gender, fullness of a face or its distinctiveness.

Piecewise smooth surface reconstruction <=SEP=> We present a general method for automatic reconstruction of accurate, concise, piecewise smooth surface models from scattered range data. The method can be used in a variety of applications such as reverse engineering—the automatic generation of CAD models from physical objects. Novel aspects of the method are its ability to model surfaces of arbitrary topological type and to recover sharp features such as creases and corners. The method has proven to be effective, as demonstrated by a number of examples using both simulated and real data.
A key ingredient in the method, and a principal contribution of this paper, is the introduction of a new class of piecewise smooth surface representations based on subdivision. These surfaces have a number of properties that make them ideal for use in surface reconstruction: they are simple to implement, they can model sharp features concisely, and they can be fit to scattered range data using an unconstrained optimization procedure.

Computer generated animation of faces <=SEP=> This paper describes the representation, animation and data collection techniques that have been used to produce "realistic" computer generated half-tone animated sequences of a human face changing expression. It was determined that approximating the surface of a face with a polygonal skin containing approximately 250 polygons defined by about 400 vertices is sufficient to achieve a realistic face. Animation was accomplished using a cosine interpolation scheme to fill in the intermediate frames between expressions. This approach is good enough to produce realistic facial motion. The three-dimensional data used to describe the expressions of the face was obtained photogrammetrically using pairs of photographs.

"Is it Weird to Still Be a Virgin": Anonymous, Locally Targeted Questions on Facebook Confession Boards <=SEP=> People have long sought answers to questions online, typically using either anonymous or pseudonymous forums or social network platforms that primarily use real names. Systems that allow anonymous communication afford freedom to explore identity and discuss taboo topics, but can result in negative disinhibited behavior such as cyberbullying. Identifiable communication systems allows one to reach a known audience and avoid negative disinhibition, but can constrain behavior with concerns about privacy and reputation. One persistent design issue is understanding how to leverage the benefits of anonymity without suffering its drawbacks. This paper presents a case study analysis of question asking on Facebook confession boards (FCBs), a tool popular on some college campuses. FCBs present a unique configuration in which members of an offline community (e.g., a university) anonymously submit content to a moderator who posts it to a Facebook page where others in the community can view it and respond. Response is via identifiable Facebook comments and likes. Our results show users asking about taboo and stigmatized topics with local others, and receiving relevant responses with little cyberbullying or negativity.

Bitcoin Block Withholding Attack: Analysis and Mitigation <=SEP=> We address two problems: first, we study a variant of block withholding (BWH) attack in Bitcoins and second, we propose solutions to prevent all existing types of BWH attacks in Bitcoins. We analyze the strategies of a selfish Bitcoin miner who in connivance with one pool attacks another pool and receives reward from the former mining pool for attacking the latter. We name this attack as “sponsored block withholding attack.” We present detailed quantitative analysis of the monetary incentive that a selfish miner can earn by adopting this strategy under different scenarios. We prove that under certain conditions, the attacker can maximize her revenue by adopting some strategies and by utilizing her computing power wisely. We also show that an attacker may use this strategy for attacking both the pools for earning higher amount of incentives. More importantly, we present a strategy that can effectively counter block withholding attack in any mining pool. First, we propose a generic scheme that uses cryptographic commitment schemes to counter BWH attack. Then, we suggest an alternative implementation of the same scheme using hash function. Our scheme protects a pool from rogue miners as well as rogue pool administrators. The scheme and its variant defend against BWH attack by making it impossible for the miners to distinguish between a partial proof of work and a complete proof of work. The scheme is so designed that the administrator cannot cheat on the entire pool. The scheme can be implemented by making minor changes to existing Bitcoin protocol. We also analyze the security of the scheme.

Deep Relevance Ranking using Enhanced Document-Query Interactions <=SEP=> We explore several new models for document relevance ranking, building upon the Deep Relevance Matching Model (DRMM) of Guo et al. (2016). Unlike DRMM, which uses context-insensitive encodings of terms and query-document term interactions, we inject rich context-sensitive encodings throughout our models, inspired by PACRR’s (Hui et al., 2017) convolutional n-gram matching features, but extended in several ways including multiple views of query and document inputs. We test our models on datasets from the BIOASQ question answering challenge (Tsatsaronis et al., 2015) and TREC ROBUST 2004 (Voorhees, 2005), showing they outperform BM25-based baselines, DRMM, and PACRR.

BrainID: Development of an EEG-based biometric authentication system <=SEP=> Authentication is a crucial consideration when securing data or any kind of information system. Though existing approaches for authentication are user-friendly, they have vulnerabilities such as the possibility & criminally threatening a user. We propose a novel approach which uses Electroencephalogram (EEG) brain signals for an authentication process. Unique features of EEG data for distinguishing brain activities can potentially be used to authenticate a user. Compared to other biometric systems, this approach is very robust and more secure because response is significantly changed according to instantaneous mental condition. In the proposed approach, the system user is asked to visualize a number while corresponding EEG signals are captured. Captured signals are used to train the system, compared in the authentication process. This approach mainly focuses on the 8 to 30 Hz Alpha and Beta combined frequency band across all EEG channels, since it is the most appropriate band for EEG signals in Brain Computer Interfaces (BCI). Common Spatial Patterns (CSP) values were used as main features to train the model. Linear discriminant analysis (LDA) was used as a classification algorithm for a given set of user data. A trained set of models for each user is embedded in the system as a parameter database. Each user selects the profile attached to their trained model before the authentication session. Eventually, a trained model can authenticate a user after memorization of pre-determined four digits which the user is asked to think at the first stage of the process. The maximum accuracy recorded with the existing data was 96.97%.

Quantifying the experience of immersion in games. <=SEP=> Games are undoubtedly the most successful computer application yet it is not easy to attribute their success to any one particular feature. Nonetheless, when talking about games, gamers and reviewers frequently refer to the immersive experience of the game as an important aspect to be attained. However, it is not clear what immersion is and even if it is a comparable experience between different players and different games. This paper aims to develop more quantifiable and therefore objective measures of immersion. We describe a study into switching from an immersive gaming experience to another task, not in the game world. Though the degree of immersion does seem to have an impact on the ability to perform the task, the experimental approach is complex and possibly quite fragile. We therefore set out hypotheses for a similar experiment with the aim of exploring whether eyetracking and body motion provide better indicators of the degree of immersion.

Design and construction of organic computing systems <=SEP=> The next generation of embedded computing systems will have to meet new challenges. The systems are expected to act mainly autonomously, to dynamically adapt to changing environments and to interact with one another if necessary. Such systems are called organic. Organic Computing systems are similar to autonomic computing systems. In addition Organic Computing systems often behave life-like and are inspired by nature/biological phenomena. Design and construction of such systems brings new challenges for the software engineering process. In this paper we present a framework for design, construction and analysis of organic computing systems. It can facilitate design and construction as well as it can be used to (semi-)formally define organic properties like self-configuration or self-adaptation. We illustrate the framework on a real-world case study from production automation.

How useful are your comments?: analyzing and predicting youtube comments and comment ratings <=SEP=> An analysis of the social video sharing platform YouTube reveals a high amount of community feedback through comments for published videos as well as through meta ratings for these comments. In this paper, we present an in-depth study of commenting and comment rating behavior on a sample of more than 6 million comments on 67,000 YouTube videos for which we analyzed dependencies between comments, views, comment ratings and topic categories. In addition, we studied the influence of sentiment expressed in comments on the ratings for these comments using the SentiWordNet thesaurus, a lexical WordNet-based resource containing sentiment annotations. Finally, to predict community acceptance for comments not yet rated, we built different classifiers for the estimation of ratings for these comments. The results of our large-scale evaluations are promising and indicate that community feedback on already rated comments can help to filter new unrated comments or suggest particularly useful but still unrated comments.

Automated Driving in Uncertain Environments: Planning With Interaction and Uncertain Maneuver Prediction <=SEP=> Automated driving requires decision making in dynamic and uncertain environments. The uncertainty from the prediction originates from the noisy sensor data and from the fact that the intention of human drivers cannot be directly measured. This problem is formulated as a partially observable Markov decision process (POMDP) with the intended route of the other vehicles as hidden variables. The solution of the POMDP is a policy determining the optimal acceleration of the ego vehicle along a preplanned path. Therefore, the policy is optimized for the most likely future scenarios resulting from an interactive, probabilistic motion model for the other vehicles. Considering possible future measurements of the surrounding cars allows the autonomous car to incorporate the estimated change in future prediction accuracy in the optimal policy. A compact representation results in a low-dimensional state-space. Thus, the problem can be solved online for varying road layouts and number of vehicles. This is done with a point-based solver in an anytime fashion on a continuous state-space. Our evaluation is threefold: At first, the convergence of the algorithm is evaluated and it is shown how the convergence can be improved with an additional search heuristic. Second, we show various planning scenarios to demonstrate how the introduction of different considered uncertainties results in more conservative planning. At the end, we show online simulations for the crossing of complex (unsignalized) intersections. We can demonstrate that our approach performs nearly as good as with full prior information about the intentions of the other vehicles and clearly outperforms reactive approaches.

3D printing of robotic soft actuators with programmable bioinspired architectures <=SEP=> Soft actuation allows robots to interact safely with humans, other machines, and their surroundings. Full exploitation of the potential of soft actuators has, however, been hindered by the lack of simple manufacturing routes to generate multimaterial parts with intricate shapes and architectures. Here, we report a 3D printing platform for the seamless digital fabrication of pneumatic silicone actuators exhibiting programmable bioinspired architectures and motions. The actuators comprise an elastomeric body whose surface is decorated with reinforcing stripes at a well-defined lead angle. Similar to the fibrous architectures found in muscular hydrostats, the lead angle can be altered to achieve elongation, contraction, or twisting motions. Using a quantitative model based on lamination theory, we establish design principles for the digital fabrication of silicone-based soft actuators whose functional response is programmed within the material's properties and architecture. Exploring such programmability enables 3D printing of a broad range of soft morphing structures. 3D-printed soft actuators have limited motion and are far from reaching the level of complexity found in biological systems. Here the authors present a multimaterial 3D printing platform for the fabrication of soft actuators displaying a wide range of motions that are programmable.

Clump splitting via bottleneck detection and shape classification <=SEP=> Under-segmentation of an image with multiple objects is a common problem in image segmentation algorithms. This paper presents a novel approach for splitting clumps formed by multiple objects due to under-segmentation. The proposed algorithm includes three steps: (1) decide whether to split a candidate connected component by application-specific shape classification; (2) find a pair of points for clump splitting and (3) join the pair of selected points. In the first step, a shape classifier is applied to determine whether a connected component should be split. In the second step, a pair of points for splitting is detected using a bottleneck rule, under the assumption that the desired objects have roughly a convex shape. In the third step, the selected splitting points from step two are joined by finding the optimal splitting line between them, based on minimizing an image energy. The shape classifier is built offline via various shape features and a support vector machine. Steps two and three are applicationindependent. The performance of this method is evaluated using images from various applications. Experimental results show that the proposed approach outperforms the state-of-the-art algorithms for the clump splitting problem. & 2011 Elsevier Ltd. All rights reserved.

Answering enumeration queries with the crowd <=SEP=> 1.1. 能否全部搞定?枚举查询 在本文中,我们思考了关系数据库管理系统 (RDBMS) 中一种最基本的运算,即利用筛选约束条件或断言 来扫描单一数据库表格;此查询枚举用户感兴趣的一 组特定项目。例如,请思考以下 SQL 查询,它要列 出可以忍耐低光环境的所有室内盆栽植物:SELECT DISTINCT name FROM Plants WHERE lightneeds = ‘low’。在使用传统的 RDBMS 并且给定数 据库状态时,此查询只有一个正确的答案,通过扫描 相关表格、筛选记录,再返回所有匹配的记录即可获 得该答案。这种方法对即便实际上无界的关系也奏效, 因为封闭世界假定指出:在查询执行之时数据库中没 有的任何记录都不存在。 相反,在 CrowdDB 等众包系统中,一旦耗尽已 存储表格中的记录时,我们可以向众人发送作业来索 取更多记录。然后问题演变为:查询结果集何时才算 完整?众包查询天生具有模糊性或拥有无界结果集, 其元组分散于网络或者仅存在于人脑。例如,我们可 以思考这样的查询:列出就业市场上现有的博士学位 应届毕业生,或者列出加利福尼亚州对绿色技术感兴 趣的企业。这种查询是利用众人力量的数据库系统的 主要用例,对发出要执行的查询的用户而言均属于劳 动密集型任务,但由于并不经常需要执行,所以不一 定值得去开发、调节和使用复杂的机器学习解决方案。 在本文中,我们将解决以下问题:“用户在众包 数据库系统的开放世界中应当如何思索枚举查询?” 我们开发的统计学工具可以帮助用户推导时间 / 成本 与完整度的权衡,还可用于推进查询执行和众包策略。

VARAN the Unbelievable: An Efficient N-version Execution Framework <=SEP=> With the widespread availability of multi-core processors, running multiple diversified variants or several different versions of an application in parallel is becoming a viable approach for increasing the reliability and security of software systems. The key component of such N-version execution (NVX) systems is a runtime monitor that enables the execution of multiple versions in parallel. Unfortunately, existing monitors impose either a large performance overhead or rely on intrusive kernel-level changes. Moreover, none of the existing solutions scales well with the number of versions, since the runtime monitor acts as a performance bottleneck.
 In this paper, we introduce Varan, an NVX framework that combines selective binary rewriting with a novel event-streaming architecture to significantly reduce performance overhead and scale well with the number of versions, without relying on intrusive kernel modifications.
 Our evaluation shows that Varan can run NVX systems based on popular C10k network servers with only a modest performance overhead, and can be effectively used to increase software reliability using techniques such as transparent failover, live sanitization and multi-revision execution.

Identification of influencers - Measuring influence in customer networks <=SEP=> Viral marketing refers to marketing techniques that use social networks to produce increases in brand awareness through self-replicating viral diffusion of messages, analogous to the spread of pathological and computer viruses. The idea has successfully been used by marketers to reach a large number of customers rapidly. If data about the customer network is available, centrality measures provide a structural measure that can be used in decision support systems to select influencers and spread viral marketing campaigns in a customer network. Usage stimulation and churn management are examples of DSS applications, where centrality of customers does play a role. The literature on network theory describes a large number of such centrality measures. A critical question is which of these measures is best to select an initial set of customers for a marketing campaign, in order to achieve a maximum dissemination of messages. In this paper, we present the results of computational experiments based on call data from a telecom company to compare different centrality measures for the diffusion of marketing messages. We found a significant lift when using central customers in message diffusion, but also found differences in the various centrality measures depending on the underlying network topology and diffusion process. The simple out-degree centrality performed well in all treatments.

Person Re-Identification by Deep Joint Learning of Multi-Loss Classification <=SEP=> Existing person re-identification (re-id) methods rely mostly on either localised or global feature representation alone. This ignores their joint benefit and mutual complementary effects. In this work, we show the advantages of jointly learning local and global features in a Convolutional Neural Network (CNN) by aiming to discover correlated local and global features in different context. Specifically, we formulate a method for joint learning of local and global feature selection losses designed to optimise person re-id when using only generic matching metrics such as the L2 distance. We design a novel CNN architecture for Jointly Learning Multi-Loss (JLML) of local and global discriminative feature optimisation subject concurrently to the same re-id labelled information. Extensive comparative evaluations demonstrate the advantages of this new JLML model for person re-id over a wide range of state-of-the-art re-id methods on five benchmarks (VIPeR, GRID, CUHK01, CUHK03, Market-1501).

Projection Based Weight Normalization for Deep Neural Networks <=SEP=> Optimizing deep neural networks (DNNs) often suffers from the ill-conditioned problem. We observe that the scaling-based weight space symmetry property in rectified nonlinear network will cause this negative effect. Therefore, we propose to constrain the incoming weights of each neuron to be unit-norm, which is formulated as an optimization problem over Oblique manifold. A simple yet efficient method referred to as projection based weight normalization (PBWN) is also developed to solve this problem. PBWN executes standard gradient updates, followed by projecting the updated weight back to Oblique manifold. This proposed method has the property of regularization and collaborates well with the commonly used batch normalization technique. We conduct comprehensive experiments on several widely-used image datasets including CIFAR-10, CIFAR-100, SVHN and ImageNet for supervised learning over the state-of-the-art convolutional neural networks, such as Inception, VGG and residual networks. The results show that our method is able to improve the performance of DNNs with different architectures consistently. We also apply our method to Ladder network for semi-supervised learning on permutation invariant MNIST dataset, and our method outperforms the state-of-the-art methods: we obtain test errors as 2.52%, 1.06%, and 0.91% with only 20, 50, and 100 labeled samples, respectively.

Connecting modalities: Semi-supervised segmentation and annotation of images using unaligned text corpora <=SEP=> We propose a semi-supervised model which segments and annotates images using very few labeled images and a large unaligned text corpus to relate image regions to text labels. Given photos of a sports event, all that is necessary to provide a pixel-level labeling of objects and background is a set of newspaper articles about this sport and one to five labeled images. Our model is motivated by the observation that words in text corpora share certain context and feature similarities with visual objects. We describe images using visual words, a new region-based representation. The proposed model is based on kernelized canonical correlation analysis which finds a mapping between visual and textual words by projecting them into a latent meaning space. Kernels are derived from context and adjective features inside the respective visual and textual domains. We apply our method to a challenging dataset and rely on articles of the New York Times for textual features. Our model outperforms the state-of-the-art in annotation. In segmentation it compares favorably with other methods that use significantly more labeled training data.

Reducing Patient Mortality in Hospitals : The Role of Human Resource <=SEP=> Developing effective health care organizations is increasingly complex as a result of demographic changes, globalization and developments in medicine. This study examines the potential contribution of organizational behavior theory and research by investigating the relationship between systems of human resource management (HRM) practices and effectiveness of patient care in hospitals. Relatively little research has been conducted to explore these issues in health care settings. In a sample of 52 hospitals in England, we examine the relationship between the HRM system and health care outcome. Specifically, we study the association between high performance HRM policies and practices and standardized patient mortality rates. The research reveals that, after controlling for prior mortality and other potentially confounding factors such as the ratio of doctors to patients, greater use of a complementary set of HRM practices has a statistically and practically significant relationship with patient mortality. The findings suggest that managers and policy makers should focus sharply on improving the functioning of relevant HR management systems in health care organizations as one important means by which to improve patient care.

Sync-DRAW: Automatic Video Generation using Deep Recurrent Attentive Architectures <=SEP=> This paper introduces a novel approach for generating videos called Synchronized Deep Recurrent Attentive Writer (Sync-DRAW). Sync-DRAW can also perform text-to-video generation which, to the best of our knowledge, makes it the first approach of its kind. It combines a Variational Autoencoder(VAE) with a Recurrent Attention Mechanism in a novel manner to create a temporally dependent sequence of frames that are gradually formed over time. The recurrent attention mechanism in Sync-DRAW attends to each individual frame of the video in sychronization, while the VAE learns a latent distribution for the entire video at the global level. Our experiments with Bouncing MNIST, KTH and UCF-101 suggest that Sync-DRAW is efficient in learning the spatial and temporal information of the videos and generates frames with high structural integrity, and can generate videos from simple captions on these datasets.

Digital Calibration Techniques for Pipelined ADC ’ s <=SEP=> A skip and fill algorithm is developed to digitally self-calibrate pipelined analog-to-digital converters (ADC’s) in real time. The proposed digital calibration technique is applicable to capacitor-ratioed multiplying digital-to-analog converters (MDAC’s) commonly used in multi-step or pipelined ADC’s. This background calibration process can replace, in effect, a trimming procedure usually done in the factory with a hidden electronic calibration. Unlike other self-calibration techniques working in the foreground, the proposed technique is based on the concept of skipping conversion cycles randomly but filling in data later by nonlinear interpolation. This opens up the feasibility of digitally implementing calibration hardware and simplifying the task of self-calibrating multi-step or pipelined ADC’s. The proposed method improves the performance of the inherently fast ADC’s by maintaining simple system architectures. To measure errors resulting from capacitor mismatch, op amp dc gain, offset, and switch feedthrough in real time, the calibration test signal is injected in place of the input signal using a split-reference injection technique. Ultimately, the missing signal within 2/3 of the Nyquist bandwidth is recovered with 16-bit accuracy using a 44-th order polynomial interpolation, behaving essentially as an FIR filter. This work was supported by the National Science Foundation under Grant MIP-9312671.

Accuracy analysis of kinect depth data <=SEP=> This paper presents an investigation of the geometric quality of depth data obtained by the Kinect sensor. Based on the mathematical model of depth measurement by the sensor a theoretical error analysis is presented, which provides an insight into the factors influencing the accuracy of the data. Experimental results show that the random error of depth measurement increases with increasing distance to the sensor, and ranges from a few millimetres up to about 4 cm at the maximum range of the sensor. The accuracy of the data is also found to be influenced by the low resolution of the depth measurements.

Role of Broca's Area in Implicit Motor Skill Learning: Evidence from Continuous Theta-burst Magnetic Stimulation <=SEP=> Complex actions can be regarded as a concatenation of simple motor acts, arranged according to specific rules. Because the caudal part of the Broca's region (left Brodmann's area 44, BA 44) is involved in processing hierarchically organized behaviors, we aimed to test the hypothesis that this area may also play a role in learning structured motor sequences. To address this issue, we investigated the inhibitory effects of a continuous theta-burst TMS (cTBS) applied over left BA 44 in healthy subjects, just before they performed a serial RT task (SRTT). SRTT has been widely used to study motor skill learning and is also of interest because, for complex structured sequences, subjects spontaneously organize them into smaller subsequences, referred to as chunks. As a control, cTBS was applied over the vertex in another group, which underwent the same experiment. Control subjects showed both a general practice learning effect, evidenced by a progressive decrease in RT across blocks and a sequence-specific learning effect, demonstrated by a significant RT increase in a pseudorandom sequence. In contrast, when cTBS was applied over left BA 44, subjects lacked both the general practice and sequence-specific learning effects. However, surprisingly, their chunking pattern was preserved and remained indistinguishable from controls. The present study indicates that left BA 44 plays a role in motor sequence learning, but without being involved in elementary chunking. This dissociation between chunking and sequence learning could be explained if we postulate that left BA 44 intervenes in high hierarchical level processing, possibly to integrate elementary chunks together.

Opinion Mining in Online Reviews About Distance Education Programs <=SEP=> The popularity of distance education programs is increasing at a fast pace. En par with this development, online communication in fora, social media and reviewing platforms between students is increasing as well. Exploiting this information to support fellow students or institutions requires to extract the relevant opinions in order to automatically generate reports providing an overview of pros and cons of different distance education programs. We report on an experiment involving distance education experts with the goal to develop a dataset of reviews annotated with relevant categories and aspects in each category discussed in the specific review together with an indication of the sentiment. Based on this experiment, we present an approach to extract general categories and specific aspects under discussion in a review together with their sentiment. We frame this task as a multi-label hierarchical text classification problem and empirically investigate the performance of different classification architectures to couple the prediction of a category with the prediction of particular aspects in this category. We evaluate different architectures and show that a hierarchical approach leads to superior results in comparison to a flat model which makes decisions independently. This work has been performed while the first and last authors were at Bielefeld University.

Net!works European Technology Platform Expert Working Group on Smart Cities Applications and Requirements Executive Summary List of Contributors Contributors Company/institute Emcanta, Es Alcatel-lucent/bell Labs, De Gowex, Es List of Acronyms 3d Three Dimensional Api Application Programming Interfa <=SEP=> Smart Cities gained importance as a means of making ICT enabled services and applications available to the citizens, companies and authorities that are part of a city's system. It aims at increasing citizens' quality of life, and improving the efficiency and quality of the services provided by governing entities and businesses. This perspective requires an integrated vision of a city and of its infrastructures, in all its components. A Smart City can be taken according to six characteristics: All these domains raise new challenges in security and privacy, since users implicitly expect systems to be secure and privacy-preserving. One of the critical elements is which role(s) the city will take up as an actor within an increasingly complex value network. New players enter the market, actors shift their business strategies, roles change, different types of platforms emerge and vie for market dominance, technological developments create new threats and opportunities, etc. An element related to the trend of platformisation is cloud computing, which is increasingly helping the private sector to reduce cost, increase efficiency, and work smarter. One particular challenge relates to open data business models. Activities necessary for Public Sector Information provision can be identified. The development of efficient and effective e-government is a prerequisite. Transnational authentication systems for citizens and businesses, agreed frameworks for data privacy, and the sharing and collection of individual and business data, are key. Smart Cities need to be able to integrate themselves into national, regional and international infrastructures. Although the implementation aspects depend strongly on the authorities of these infrastructures, European wide recommendations and directives will definitely contribute to accelerate the deployment of Smart Cities. Health, inclusion and assisted living will play an essential role, since the demand for related services is rising, because ageing is changing disease composition. Requirements address a number of technologies, beyond the ones related to mobile and fixed networks. An integrated perspective on healthcare solutions for the near-to long-term can be foreseen, bridging a direct gap in between the health area and the technological development of communications (radio and network components). The needs for mobility in urban areas result into a number of problems, such as traffic congestion and energy consumption, which can be alleviated by exploiting Intelligent Transportation Systems and further adoption of vehicle-to-vehicle and vehicle-to-infrastructure communication networks. The information being managed in this area can be relevant to other domains, which increases its potential. An effective deployment …

A 5.8-GHz radar sensor chip in 0.18-μm CMOS for non-contact vital sign detection <=SEP=> This paper presents a 5.8-GHz radar sensor chip for non-contact vital sign detection. The sensor chip is designed and fabricated in TSMC 0.18 μm CMOS 1P6M process. Except for the low-noise amplifier, all the active and passive components of the radar system are fully integrated in a single CMOS chip. With packaging on the printed-circuit board and connecting transmitting and receiving antennas, the radar sensor chip has been successfully demonstrated to detect the respiration and heart beat rates of a human adult.

Linear scan register allocation <=SEP=> We describe a new algorithm for fast global register allocation called linear scan. This algorithm is not based on graph coloring, but allocates registers to variables in a single linear-time scan of the variables' live ranges. The linear scan algorithm is considerably faster than algorithms based on graph coloring, is simple to implement, and results in code that is almost as efficient as that obtained using more complex and time-consuming register allocators based on graph coloring. The algorithm is of interest in applications where compile time is a concern, such as dynamic compilation systems, “just-in-time” compilers, and interactive development environments.