Datasets:

saishshinde15

/

ResearchPapers-dataset-1000k

like 0

Prime generating polynomial functions are known that can produce sequences of prime numbers (e.g. Euler polynomials). However, polynomials which produce consecutive prime numbers are much more difficult to obtain. In this paper, we propose approaches for both these problems. The first uses Cartesian Genetic Programming (CGP) to directly evolve integer based prime-prediction mathematical formulae. The second uses multi-chromosome CGP to evolve a digital circuit, which represents a polynomial. We evolved polynomials that can generate 43 primes in a row. We also found functions capable of producing the first 40 consecutive prime numbers, and a number of digital circuits capable of predicting up to 208 consecutive prime numbers, given consecutive input values. Many of the formulae have been previously unknown.

['James Alfred Walker', 'Julian F. Miller']

Predicting prime numbers using cartesian genetic programming

Ubiquitous Microblogging als dezentrales Entwurfsparadigma für leichtgewichtige Informationssysteme.

['Martin Böhringer', 'Peter Gluchowski']

Ubiquitous Microblogging als dezentrales Entwurfsparadigma für leichtgewichtige Informationssysteme.

International Journal of Intelligent Systems#R##N#Early View (Online Version of Record published before inclusion in an issue)

['Fateme Kouchakinejad', 'Mashaallah Mashinchi', 'Radko Mesiar']

On Algebraic Structure of L-Fuzzy Bags

We present a Naive Bayes classification model where the features are temporal association rules (TARs) annotated with their possible recurrence patterns, referred to as periodic TARs. To analyze clinical time series we rely on several Temporal Data Mining (TDM) methods, like temporal abstractions (TAs). We used this approach to diagnose coronary heart disease (CHD) based on patient history. Firstly, we exploited TAs to preprocess data and obtain qualitative and trend temporal patterns. Secondly, we applied a temporal pattern mining algorithm able to detect TARs by identifying the most frequent temporal relationships among the TAs. Finally, the classifier incorporates periodic TARs as its features, by considering the possible recurrence patterns of each TAR within the relevant patient history. A key claim of this research is that where long time periods are of significance in some medical domain, such as the CHD domain, higher order temporal abstractions can yield better performance. The viability of this claim is demonstrated by comparing the performance of the classifier with periodic TARs as its features with that of a baseline classifier whose features are simple TARs representing the occurrence or not of temporal relationships, without consideration of possible periodic occurrences of the given temporal relationships. The results obtained illustrate the comparatively high performance of the periodic TAR classifier over the baseline, simple TARs classifier, thus demonstrating the effectiveness of the proposed approach.

['Kalia Orphanou', 'Arianna Dagliati', 'Lucia Sacchi', 'Athena Stassopoulou', 'Elpida Keravnou', 'Riccardo Bellazzi']

Combining Naive Bayes Classifiers with Temporal Association Rules for Coronary Heart Disease Diagnosis

High performance computing is the paradigm of choice in the solution of many real world problems, where the complexity of large-scale phenomena or the need for real time results requires the use of increasingly powerful computational resources. Although low cost off the shelf supercomputers, namely Beowulf class systems, have gained a widespread popularity, an effective use of high performance computing resources and its diffusion still depends on the availability of easy-to-use software tools enabling a transparent access to computing resources. In that scenario many projects are devoted to the implementation of problem solving environments (PSEs) for high performance computers. The authors describe the parallelization of IDL, a commercial product by Research Systems, that enables an intuitive use of a Beowulf supercomputer and we assess its performance with wall clock execution times and some well known parameters.

["Luisa D'Amore", 'Mario Rosario Guarracino', 'Giuliano Laccetti']

On the parallelization of a commercial PSE for scientific computing

This contribution describes a new functional principle for the motion of walking robots by means of shape memory composites. It illustrates the phase-coupled motion of actuator components with different shape memory alloys allowing wave-like or inch-worm behavior, respectively. The thermo-mechanical properties of the corresponding thin film composites with Ti(NiCu) and (TiHf)Ni alloys are discussed with the focus on their hysteresis. The shape memory effect of the actuators is characterized and samples are performed to prove their capabilities. The contribution also presents a bistable shape memory composite in which a PMMA polymer fixes the bending states of the metallic composite to reduce the energy consumption.

['Bernhard Winzek', 'Tobias Sterzl', 'Holger Rumpf', 'Eckhard Quandt']

Smart motion control by phase-coupled shape memory composites

Orchestrating Docker Containers in the HPC Environment.

['Joshua Higgins', 'Violeta Holmes', 'Colin C. Venters']

Orchestrating Docker Containers in the HPC Environment.

The existing rival penalized competitive learning (RPCL) algorithm and its variants have provided an attractive way to perform data clustering without knowing the exact number of clusters. However, their performance is sensitive to the preselection of the rival delearning rate. In this paper, we further investigate the RPCL and present a mechanism to control the strength of rival penalization dynamically. Consequently, we propose the rival penalization controlled competitive learning (RPCCL) algorithm and its stochastic version. In each of these algorithms, the selection of the delearning rate is circumvented using a novel technique. We compare the performance of RPCCL to RPCL in Gaussian mixture clustering and color image segmentation, respectively. The experiments have produced the promising results.

['Yiu-ming Cheung']

On rival penalization controlled competitive learning for clustering with automatic cluster number selection

Art-Works Colour Calibration by Using the VASARI Scanner.

['Andrea Abrardo', 'Vito Cappellini', 'Maria Domenica Cappellini', 'Alessandro Mecocci']

Art-Works Colour Calibration by Using the VASARI Scanner.

In spite of the development of technologies that support human-computer or human-human interaction, few studies have been conducted for improving interactions between humans and pets, pets and computers, or between two pets. We propose a new area of research on entertainment using computers, called "human-pet interaction." As an initial step in this research, we have developed a series of sensing devices that can be attached to pet cats, called Cat@Log (cat-a-log). These devices comprise various sensing units such as a camera, a GPS, an accelerometer, and a Bluetooth module. Here, we attempted to determine an optimum design of the devices such that they can be attached to a pet without causing discomfort to it; for determining this design, we considered parameters such as the device's form factor and way of attachment. These developed devices can recognize the experiences and activities of cats; information sensed by the devices is transmitted in real time by using the Bluetooth wireless module. We used this platform and developed a software system that automatically recognizes a pet's high-level behavior and posts it to Twitter.

['Kyoko Yonezawa', 'Takashi Miyaki', 'Jun Rekimoto']

Cat@Log: sensing device attachable to pet cats for supporting human-pet interaction

It has been perceived that innovation has been dominated by startups and new small companies whereas large companies struggle with balancing the challenges of operational excellence and product innovativeness. Internal corporate venturing has been promoted as one way to foster radical innovation in corporation. Lean startup suggests that internal corporate venturing can be managed through engineering science, which can be taught. However, the importance of the learning gained by small innovative and entrepreneurial teams has yet to be fully conveyed to the whole organisations. To investigate this complex phenomenon, a conceptual framework combining internal corporate venture and Lean startup has been developed based on the literature review. The framework will serve as a theoretical lens to collect and analyse empirical evidence through a multiple case study approach. It enables a better understanding of the potential benefits and challenges of practising Lean startup in large companies.

['Henry Edison']

A Conceptual Framework of Lean Startup Enabled Internal Corporate Venture

Multi-radio Multi-channel Wireless Networks (M 2 WNs) have been studied intensively over the past decade with focus on traffic management functionalities such as channel-to-interface assignment, traffic routing and scheduling. These developed solutions always assumed continuous normal operation of all network components while failing to take into consideration the failure-prone nature of wireless networks. In this article, we develop a novel backup scheme to improve the robustness of M 2 WNs against random failures. Performance evaluation results demonstrate the ability of the scheme to maintain a much higher system throughput compared to traditional failure recovery approaches.

['Peng Sun', 'Nancy Samaan']

Random node failures and wireless networks connectivity: A novel recovery scheme

Relationships among different modeling perspectives have been systematically investigated focusing either on given notations (e.g. OMT) or on domain reference models (e.g. SAP). In contrast, many successful informal methods for business analysis and requirements engineering (e.g. JAD) emphasize team negotiation, goal orientation and flexibility of modeling notations. This paper addresses the question how much formal and computerized support can be provided in such settings without destroying their creative tenor. Our solution comprises four components: (1) A modular conceptual modeling formalism organizes individual perspectives and their interrelationships. (2) Perspective schemata are linked to a conceptual meta meta model of shared domain terms, thus giving the architecture a semantic meaning and enabling adaptability and extensibility of the network of perspectives. (3) Inconsistency management across perspectives is handled in a goal-oriented manner, by defining the analysis goals as meta rules which are automatically adapted to perspective schemata. (4) Continuous incremental maintenance of inconsistency information is provided by exploiting recent view maintenance techniques from deductive databases. The approach has been fully implemented as an extension to the ConceptBase meta database management system and has been experimentally applied in the context of business analysis and data warehouse design.

['Hans W. Nissen', 'Matthias Jarke']

Requirements engineering repositories : Formal support for informal teamwork methods

Ontological Approach to Design Reasoning with the Use of Many-Sorted First-Order Logic

['Wojciech Palacz', 'Ewa Grabska', 'Grażyna Ślusarczyk']

Ontological Approach to Design Reasoning with the Use of Many-Sorted First-Order Logic

Repeaterless low swing interconnects are potential candidates for high speed low power signaling over on-chip global wires. Capacitive pre-emphasis at the transmitter has been shown to improve the achievable data rate by increasing the relative power at high frequencies. This paper shows an improved transmitter with a 1-tap feed-forward equalizer in addition to capacitive pre-emphasis. A design method for finding the transmitter design parameters using scrupulously chosen bit vectors is also presented. Post layout simulations show that the proposed link achieves a data rate of 4 Gbps over a 10 mm long M8 line with energy consumption of 313 fJ/bit in 90 nm CMOS technology.

['K. Naveen', 'Marshnil Vipin Dave', 'Maryam Shojaei Baghini', 'Dinesh Kumar Sharma']

A Feed-Forward Equalizer for Capacitively Coupled On-Chip Interconnect

We propose a new highly scalable wavelet transform-based image coder, called S-SPECK, on the extension of a well-known zero-block image coder SPECK, by achieving not only distortion scalability, resolution scalability, and region of interest (ROI) retrievability, but also excellent compression performance with very low computational complexity. Though new features have been introduced into S-SPECK, our coder is quite competitive with SPECK on compression performance (peak signal-to-noise ratio) and computational complexity (encoding and decoding times) at various bit rates for standard test images. A novel quality layer formatting method is implemented in S-SPECK, which is much simpler and faster than PCRD used in JPEG2000. Extensive experiments have verified all our claims for S-SPECK.

['Gui Xie', 'Hong Shen']

Highly scalable, low-complexity image coding using zeroblocks of wavelet coefficients

This paper developed power consumption profiles of mobile multimedia terminal for typical application scenarios of WCDMA communications. The power consumptions and their efficiencies are investigated for the terminal architecture featuring with the combined application of the BF antenna and the OFDM technologies. Processing MIPs requirement for media data processor is also investigated together with the evaluation of the power saving effect of applying the multi-level supply voltages and operating frequencies, which is named as a dynamic voltage scaling (DVS) technology. Average power saving of 25% can be achieved for high-speed multimedia terminals using the DVS along with the OFDM modulation scheme

['Jae-Sik Lee', 'Byoung-Il Kim', 'Jae-Pil Moon', 'Tae-Gyu Chang', 'Vijay K. Garg']

Power saving in a mobile multimedia terminal

There is a large gap between mathematical structures and the structures computer implementations are based on. To stimulate research to overcome this---especially for infinitary structures---highly non-trivial problem the Dagstuhl Seminar 11411 ``Computing with Infinite Data: Topological and Logical Foundations'' was held. This report collects the ideas that were presented and discussed during the course of the seminar.

['Ulrich Berger', 'Vasco Brattka', 'Victor L. Selivanov', 'Dieter Spreen', 'Hideki Tsuiki']

Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411).

Follow-up calls after ambulatory visits are not routinely done, yet they can potentially detect and mitigate unresolved problems. Automated calls via an Interactive Voice Response System (IVRS) are an innovative way to conduct follow-up, but patients’ attitudes toward follow-up calls are unknown. This study assessed 1) patient perceptions about follow-up calls after visits; 2) differences in perceptions between human and IVRS calls; and 3) association between follow-up calls and patient satisfaction with care. Post-visit follow-up calls in two ambulatory care setting were done in two phases. Phase 1 used a human caller and phase 2 used IVRS. Patient satisfaction questionnaires were completed after each phase. Results showed that 88% of patients favor the idea of the calls and those receiving them found them helpful. There were no differences in attitudes between patients receiving calls from clinic staff or from an IVRS. Patients receiving calls had higher patient satisfaction scores than those not called. Conclusion: Patients value follow-up calls and they are associated with patient satisfaction with care. IVRS is an innovative way to conduct post-visit follow-up.

['Shannon H. Houser', 'Midge N. Ray', 'Richard S. Maisiak', 'Anantachai Panjamapirom', 'James Willing', 'Gordon D. Schiff', 'Thomas M. English', 'Christa R. Nevin', 'Eta S. Berner']

Telephone Follow-Up in Primary Care: Can Interactive Voice Response Calls Work?

Speaker dependent model order selection of spectral envelopes.

['Matthias Wölfel']

Speaker dependent model order selection of spectral envelopes.

This paper investigates some aspects of how location-based game concepts are challenging the traditions of gaming. The initial hypothesis is that location-based gaming that utilizes city space as a game board seem to be in confl ict with the classical defi nitions of ‘play’ and ‘game’. The nature of pervasive gaming is investigated in relation to different levels of mobile use and the social construction of urban space. The routines attached to mobile phones are mainly connected to interpersonal communication but also include certain ‘play with location’. Therefore a mobile phone, regardless of its interface limitations, suits quite well the location-based multi-user approach. I also argue that playing in familiar real world locations brings new nuances and meanings to these places. On the other hand some elements of real life can take part in shaping the entire gaming experience.

['Olli Sotamaa']

All The World's A Botfighter Stage: Notes on Location-based Multi-User Gaming.

Motivated by runtime verification of QoS requirements in self-adaptive and self-organizing systems that are able to reconfigure their structure and behavior in response to runtime data, we propose a QoS-aware variant of Thompson sampling for multi-armed bandits. It is applicable in settings where QoS satisfaction of an arm has to be ensured with high confidence efficiently, rather than finding the optimal arm while minimizing regret. Preliminary experimental results encourage further research in the field of QoS-aware decision making.

['Lenz Belzner', 'Thomas Gabor']

QoS-Aware Multi-armed Bandits

Robotic animals are regularly used in behavioral experiments, typically in experimental interactions with individuals of the species they were modelled on. In order to do so successfully, these robots need to be designed carefully, taking into consideration the specific perceptual system of the model species. We used marker-based motion capture to measure head bobbing in a widely popular lizard species, bearded dragons, and found that head bobbing is highly stereotypic yet differs subtly when displayed towards males and females. These results were then used for the construction of a robotic lizard, with the aim to use it in behavioral and cognitive studies, focusing on social cognition. This is the first study to use motion capture of head bobbing in lizards to inform the design of a robotic animal.

['Anna Frohnwieser', 'Alexander P. Willmott', 'John Murray', 'Thomas W. Pike', 'Anna Wilkinson']

Using Marker-Based Motion Capture to Develop a Head Bobbing Robotic Lizard

Characters in real-time computer games need to move smoothly and thus need to search in real time. In this paper, we describe a simple but powerful way of speeding up repeated A* searches with the same goal states, namely by updating the heuristics between A* searches. We then use this technique to develop a novel real-time heuristic search method, called Real-Time Adaptive A*, which is able to choose its local search spaces in a fine-grained way. It updates the values of all states in its local search spaces and can do so very quickly. Our experimental results for characters in real-time computer games that need to move to given goal coordinates in unknown terrain demonstrate that this property allows Real-Time Adaptive A* to follow trajectories of smaller cost for given time limits per search episode than a recently proposed real-time heuristic search method [5] that is more difficult to implement.

['Sven Koenig', 'Maxim Likhachev']

Real-time adaptive A*

Humanoid robotics and SLAM (Simultaneous Localisation and Mapping) are certainly two of the most significant themes of the current worldwide robotics research effort, but the two fields have up until now largely run independent parallel paths, despite the obvious benefit to be gained in joining the two. The next major step forward in humanoid robotics will be increased autonomy, and the ability of a robot to create its own world map on the fly will be a significant enabling technology. Meanwhile, SLAM techniques have found most success with robot platforms and sensor configurations which are outside of the humanoid domain. Humanoid robots move with high linear and angular accelerations in full 3D, and normally only vision is available as an outward-looking sensor. Building on recently published work on monocular SLAM using vision, and on pattern generation, we show that real-time SLAM for a humanoid can indeed be achieved. Using HRP-2, we present results in which a sparse 3D map of visual landmarks is acquired on the fly using a single camera and demonstrated loop closing and drift-free 3D motion estimation within a typical cluttered indoor environment. This is achieved by tightly coupling the pattern generator, the robot odometry and inertial sensing to aid visual mapping within a standard EKF framework. To our knowledge this is the first implementation of real-time 3D SLAM for a humanoid robot able to demonstrate loop closing.

['Olivier Stasse', 'Andrew J. Davison', 'Ramzi Sellaouti', 'Kazuhito Yokoi']

Real-time 3D SLAM for Humanoid Robot considering Pattern Generator Information

Binary segmentation, a problem of extracting foreground objects from the background, often arises in medical imaging and document processing. Popular existing solutions include expectation maximization (EM) algorithm, Otsu thresholding, K-sigma thresholding, and the recently proposed generalized principal component analysis (GPCA). We apply these algorithms to segmentation of noisy images with small foreground objects. Such images often arise in change detection applications such as functional magnetic resonance imaging (fMRI). In our experiments none of the algorithms performed sufficient well when the total size of foreground regions was much smaller than the size of the background region. We propose a novel algorithm, called sGPCA, that can robustly estimate the intensity of small foreground objects in the presence of noise. The intensity estimate obtained can be used to determine an optimal threshold value or to initialize EM and Markov random field (MRF) based segmentation algorithms.

['Rashi Samur', 'Vitali Zagorodnov']

Segmenting small regions in the presence of noise

Side-channel attacks (SCA) can be used to reveal the security key stored in cryptographic implementations by monitoring characteristics such as power consumption and subsequently applying statistical analysis techniques. However, cryptographic algorithms, such as SHACAL-2, which do not have any S-Box operations, are more resistant to SCA than algorithms that do contain S-Box operations, such as the S-box computation in DES or AES. In this paper, the advantages of SHACAL-2 in relation to its resistance to differential power analysis (DPA) are outlined. The first reported DPA attack of a SHACAL-2 encryption algorithm FPGA implementation is also presented. Finally, the effect of using different power models in the DPA attack of SHACAL-2 is discussed.

['Yingxi Lu', "Maire O'Neill", 'John V. McCanny']

Differential Power Analysis of a SHACAL-2 hardware implementation

Person identification by integrating wearable sensors and tracking results from environmental sensors

['Tetsushi Ikeda', 'Hiroshi Ishiguro', 'Dylan F. Glas', 'Masahiro Shiomi', 'Takahiro Miyashita', 'Norihiro Hagita']

Person identification by integrating wearable sensors and tracking results from environmental sensors

Polarization and Depolarization Current ( PDC) testing is a non-destructive dielectric testing method to determine the conductivity of insulations. It is one of the dielectric diagnostic techniques based on time domain measurement. PDC measurement technique has gained immense popularity due to its ability to assess the condition of HV insulation. PDC measurement can provide information about the conductivity within the initial periods (seconds) after a DC step voltage application. This paper present the review and comparison results from several published papers on application of PDC method in finding the conductivity of the various types of insulators. The scope of the review covered solid and liquid insulations types. In this paper, for solid insulation the studied was focused one ables insulations, electric machine stator insulation and paper insulator in power transformer insulation. For liquid insulation, the review and comparison was done on the biodegradable and mineral transformer oils. The review results show that the PDC technique successfully give indication on level of conductivity of the HV insulation materials.

['N. A. M. Jamail', 'M. A. M. Piah', 'Nor Asiah Muhamad']

Comparative study on conductivity using Polarization and Depolarization Current (PDC) test for HV insulation

In this paper, we introduce the concept of information technology outsourcing (ITO) configuration', defined as: a high-level description of the set of choices the organization makes in craftins its IT outsourcing portfolio. From research into 49 ITO arrangements studied over time, we identify seven attributes - Scope Grouping, Supplier Grouping, Financial Scale, Duration, Pricing, Resource Ownership, and Commercial Relationship - as key descriptors of an organization's ITO configuration. Seven further cases tested the relevance of the attributes. The contribution of this paper is its articulation of the concept of configuration as a taxonomy of ITO structural characteristics, the key attributes, and demonstration that configuration is an important concept for understanding, comparing, and managing ITO arrangements. In particular, the paper details the rationales for 31 different options in outsourcing, the risks and management issues emerging for each, and how these play out in different combinations in selected, illustrative case studies.

['Sara Cullen', 'Peter B. Seddon', 'Leslie P. Willcocks']

IT outsourcing configuration: Research into defining and designing outsourcing arrangements

A novel scheme to obtain the optimum tissue heating condition during hyperthermia treatment is proposed. To do this, the effect of the controllable overall heat transfer coefficient of the cooling system is investigated. An inverse problem by a conjugated gradient with adjoint equation is used in our model. We apply the finite difference time domain method to numerically solve the tissue temperature distribution using Pennes bioheat transfer equation. In order to provide a quantitative measurement of errors, convergence history of the method and root mean square of errors are also calculated. The effects of heat convection coefficient of water and thermal conductivity of casing layer on the control parameter are also discussed separately.

['Seyed Ali Aghayan', 'Dariush Sardari', 'Seyed Rabii Mahdi Mahdavi', 'Mohammad Hasan Zahmatkesh']

An Inverse Problem of Temperature Optimization in Hyperthermia by Controlling the Overall Heat Transfer Coefficient

In this paper, a method for reducing test data volume of BIST-aided scan test (BAST) is proposed. In our BAST method, scan chains are ordered using compatible flip-flops to reduce the conflicting bits between ATPG pattern and random pattern obtained by LFSR. The inverter block in BIST-aided scan architecture is modified for shifting inverter code such that the random pattern produced by LFSR has less conflicting bits with ATPG patterns when providing the test pattern to the scan chains. The experimental results show the method can reduce the test data volume than the previous method.

['Masashi Ishikawa', 'Hiroyuki Yotsuyanagi', 'Masaki Hashizume']

Test Data Reduction for BIST-Aided Scan Test Using Compatible Flip-Flops and Shifting Inverter Code

An important but difficult problem in fitting finite mixture models is estimating and testing the number of components in the mixture. Regularity conditions do not hold for large sample likelihood theory so that likelihood ratio tests cannot easily be implemented. However, a number of homogeneity tests have been developed to test for the presence of a mixture. Weighted versions of homogeneity tests are presented that can be used to test for the presence of additional components in a mixture. These tests are easily implemented, do not require long computational times and can incorporate covariates. Examples are given to illustrate the methodology and simulation results are presented that suggest that the tests have power comparable to the bootstrap likelihood ratio test.

['Edward Susko']

Weighted tests of homogeneity for testing the number of components in a mixture

The main theme of this paper is to propose a novel on-line maximum duty point tracking (MDPT) technique to improve the efficiency of the server power. The server power consists of a power factor corrector (PFC) and a phase-shift full-bridge (PSFB) converter. The proposed MDPT technique controls the dc-link voltage of the PFC to retain the maximum duty of the PSFB converter, thereby reducing the circulating loss and switching losses of the converter. It will be shown that the overall efficiency can therefore be significantly improved to meet the 80 PLUS Gold code. Moreover, the impact of the proposed MDPT control on the hold-up time is investigated. It will be shown that the dc-link capacitance should be increased in order to give the same hold-up time. The experimental system is set up using a digital signal processor as the digital controller. The specifications of the server power supply include: ac input voltage = 110/220 V, dc output voltage = 12 V, and output power = 480 W. Experimental results show that the efficiency can be improved from light-load to full-load conditions. It will be shown that the efficiency can therefore be improved up to 2.52% to meet the 80 PLUS Gold code. These results confirm the effectiveness of the proposed MDPT technique.

['Yen-Shin Lai', 'Zih-Jie Su']

Novel On-Line Maximum Duty Point Tracking Technique to Improve Two-Stage Server Power Efficiency and Investigation Into Its Impact on Hold-Up Time

3D Protein Structure Prediction with Local Adjust Tabu Search Algorithm

['Xiaoli Lin', 'Fengli Zhou']

3D Protein Structure Prediction with Local Adjust Tabu Search Algorithm

This paper presents a new design approach to nonlin- ear observers for Ito stochastic nonlinear systems with guaranteed stability. A stochastic contraction lemma is presented which is used to analyze incremental stability of the observer. A bound on the mean-squared distance between the trajectories of original dynamics and the observer dynamics is obtained as a function of the contraction rate and maximum noise intensity. The ob- server design is based on a non-unique state-dependent coefficient (SDC) form, which parametrizes the nonlinearity in an extended linear form. The observer gain synthesis algorithm, called lin- ear matrix inequality state-dependent algebraic Riccati equation (LMI-SDARE), is presented. The LMI-SDARE uses a convex combination of multiple SDC parametrizations. An optimization problem with state-dependent linear matrix inequality (SDLMI) constraints is formulated to select the coefficients of the convex combination for maximizing the convergence rate and robustness against disturbances. Two variations of LMI-SDARE algorithm are also proposed. One of them named convex state-dependent Riccati equation (CSDRE) uses a chosen convex combination of multiple SDC matrices; and the other named Fixed-SDARE uses constant SDC matrices that are pre-computed by using conserva- tive bounds of the system states while using constant coefficients of the convex combination pre-computed by a convex LMI opti- mization problem. A connection between contraction analysis and L2 gain of the nonlinear system is established in the presence of noise and disturbances. Results of simulation show superiority of the LMI-SDARE algorithm to the extended Kalman filter (EKF) and state-dependent differential Riccati equation (SDDRE) filter.

['Ashwin P. Dani', 'Soon Jo Chung', 'Seth Hutchinson']

Observer Design for Stochastic Nonlinear Systems via Contraction-Based Incremental Stability

Quasi-Additive (QA) algorithms are a kind of on-line learning algorithms having two parameter vectors: One is an accumulation of input vectors and the other is a weight vector for prediction associated with the former by a non-linear function. We show that the vectors have a dually-flat structure from the information-geometric point of view, which makes it easier to discuss the convergence properties of the algorithms, as presented here.

['Kazushi Ikeda']

On Geometric Structure of Quasi-Additive Learning Algorithms

Filling the gap between guideline development and formalization process - a requirement analysis.

['Soudabeh Khodambashi', 'Øystein Nytrø']

Filling the gap between guideline development and formalization process - a requirement analysis.

Image hashing has become a major research area due to rapid growth of image alteration techniques that can tamper digital images. The major concern of all image hashing schemes is the selection of robust features. Local Binary Pattern (LBP) is a technique that selects robust features for different image applications. This paper presents a perceptual image hashing scheme by the utilization of Noise Resistant Local Binary Pattern (NRLBP), a modified form of the LBP. The features of NRLBP are extracted from non-overlapping blocks of a gray scale image. The NRLBP is combined with Singular Value Decomposition (SVD) to provide good robustness characteristics against a number of non-malicious distortions. Another major advantage of the proposed scheme is to detect localized tampered regions. Experimental results exhibit that the proposed scheme has the capability to detect tampering as small as 3% of the image size and at the same time offers good robustness properties.

['Syed Qasim Abbas', 'Fawad Ahmed', 'Natasa Zivic', 'Obaid Ur-Rehman']

Perceptual image hashing using SVD based Noise Resistant Local Binary Pattern

Crowd-sensing is a popular way to sense and collect data using smartphones that reveals user behaviors and their correlations with device performance. PhoneLab is one of the largest crowd-sensing platform based on the Android system. Through experimental instrumentations and system modifications, researchers can tap into a sea of insightful information that can be further processed to reveal valuable context information about the device, user and the environment. However, the PhoneLab data is in JSON format. The process of inferring reasons from data in this format is not straightforward. In this paper, we introduce PLOMaR — an ontology framework that uses SPARQL rules to help researchers access information and derive new information without complex data processing. The goals are to (i) make the measurement data more accessible, (ii) increase interoperability and reusability of data gathered from different sources, (iii) develop extensible data representation to support future development of the PhoneLab platform. We describe the models, the JSON to RDF mapping processes, and the SPARQL rules used for deriving new information. We evaluate our framework with three application examples based on the sample dataset provided.

['Yogesh Jagadeesan', 'Peizhao Hu', 'Carlos R. Rivero']

PLOMaR: An ontology framework for context modeling and reasoning on crowd-sensing platform

Abundant new information about signaling pathways in forebrain microcircuits presents many challenges, and opportunities for discovery, to computational neuroscientists who strive to bridge from microcircuits to flexible cognition and action. Accurate treatment of microcircuit pathways is especially critical for creating models that correctly predict the outcomes of candidate neurological therapies. Recent models are trying to specify how cortical circuits that enable planning and voluntary actions interact with adaptive subcortical microcircuits in the basal ganglia. The basal ganglia are strongly implicated in reinforcement learning, and in all behavior and cognition over which the frontal lobes exert flexible control. The persisting role of the basal ganglia shows that ancient vertebrate designs for motivated action selection proved adaptable enough to support many "modern" behavioral innovations, including fluent generation of language and speech. This paper summarizes how recent models have incorporated realistic representations of microcircuit features, and have begun to trace their computational implications. Also summarized are recent empirical discoveries that provide guidance regarding how to formulate the rules for synaptic modification that govern learning in cortico-striatal pathways. Such efforts are contributing to an emerging synthesis based on an interlocking set of computational hypotheses regarding cortical interactions with basal ganglia and thalamic nuclei. These hypotheses specify how specialized microcircuits solve learning and control problems inherent to the brain's parallel design.

['Daniel Bullock', 'Can Ozan Tan', 'Yohan J. John']

Computational perspectives on forebrain microcircuits implicated in reinforcement learning, action selection, and cognitive control

Changes in Brain Blood Flow by the Use of 2D/3D Games

['Masumi Takada', 'Yuki Mori', 'Fumiya Kinoshita', 'Hiroki Takada']

Changes in Brain Blood Flow by the Use of 2D/3D Games

Japanese has more variety of expressions for food; the expressions have been changed through the times. In Japanese, "metaphor," "onomatopoeia," and "adjectives generally not for food" are often used to express the taste and texture of food. Which and how the expression is used depends on individual sensibility based on location and generation; especially, the youngers sometimes use new expressions. Since, it is difficult to extract Japanese taste and texture expressions from Web reviews based on a fixed dictionary. This paper proposes an interactive framework to collect Japanese taste and texture expressions for food. Using the proposed framework, varied and many expressions would be semi-automatically collected. Based on the collected expressions, the sentiment analysis for food will be facilitated.

['Naoki Shino', 'Ryosuke Yamanishi', 'Yoko Nishihara', 'Junichi Fukumoto']

A Framework to Collect Japanese Expression for Food Taste and Texture

A system fails at time T but does not display any symptoms of failure until time T + S; both T and S are random variables. Detection of failure is possible either because the system displays symptoms of failure or by means of an inspection before the appearance of symptoms. A cost c is associated with each inspection and a cost-rate v is incurred after failure until detection. For a restricted class of failure densities, the inspection procedure that minimizes the total expected cost can be found by means of an iterative algorithm.

['Bhaskar Sengupta']

Inspection Procedures when Failure Symptoms Are Delayed

A very efficient and robust visual object tracking algorithm based on the particle filter is presented. The method characterizes the tracked objects using color and edge orientation histogram features. While the use of more features and samples can improve the robustness, the computational load required by the particle filter increases. To accelerate the algorithm while retaining robustness we adopt several enhancements in the algorithm. The first is the use of integral images for efficiently computing the color features and edge orientation histograms, which allows a large amount of particles and a better description of the targets. Next, the observation likelihood based on multiple features is computed in a coarse-to-fine manner, which allows the computation to quickly focus on the more promising regions. Quasi-random sampling of the particles allows the filter to achieve a higher convergence rate. The resulting tracking algorithm maintains multiple hypotheses and offers robustness against clutter or short period occlusions. Experimental results demonstrate the efficiency and effectiveness of the algorithm for single and multiple object tracking.

['C. H. Yang', 'Ramani Duraiswami', 'Larry S. Davis']

Fast multiple object tracking via a hierarchical particle filter

We analyze the data complexity of ontology-mediated querying where the ontologies are formulated in a description logic (DL) of the ALC family and queries are conjunctive queries, positive existential queries, or acyclic conjunctive queries. Our approach is non-uniform in the sense that we aim to understand the complexity of each single ontology instead of for all ontologies formulated in a certain language. While doing so, we quantify over the queries and are interested, for example, in the question whether all queries can be evaluated in polynomial time w.r.t. a given ontology. Our results include a PTime/coNP-dichotomy for ontologies of depth one in the description logic ALCFI, the equivalence of a PTime/coNP-dichotomy for ALC and ALCI-ontologies of unrestricted depth to the famous dichotomy conjecture for CSPs by Feder and Vardi, and the failure of PTime/coNP-dichotomy theorem for ALCF-ontologies. Regarding the latter DL, we also show that it is undecidable whether a given ontology admits PTime query evaluation.

['Carsten Lutz', 'Frank Wolter']

The Data Complexity of Description Logic Ontologies

Focusing on noise reduction in color images, an ensemble-based vector median filter (EVMF) is proposed, which integrates the technique of vector median filtering into the framework of ensemble learning. The algorithm consists of two main steps: 1) Base filtering step, where a contaminated image is filtered by a group of vector median filters (i.e. base filters) in parallel; 2) Meta-filtering step, where the outputs of all the base filters are fed into a vector median filter (i.e. meta-filter) to obtain the final result. The effectiveness performance of EVMF is evaluated and compared with that of several non-ensemble vector median filtering algorithms through the simulation experiment. The experimental results demonstrate that EVMF outperforms the non-ensemble filtering approaches on both noise suppression and detail preservation.

['Ling Zhong', 'Yun Zhang', 'Yan Xing']

An ensemble vector median filter for color image denoising

Abstract-In this paper, we investigate the effect of co-channel interference on the performance of dual-hop communications with amplify-and-forward relaying. Based on the derivation of the effective signal-to-interference-plus-noise ratio (SINR) at the destination node of the system, taking into account co-channel interference, we obtain expressions for the error and outage probabilities. Moreover, we study the performance of the system in the high SINR regime. Monte-Carlo simulations are further provided and confirm the accuracy of the analytical results.

['Salama S. Ikki', 'Sonia Aissa']

Performance Analysis of Dual-Hop Relaying Systems in the Presence of Co-Channel Interference

Research, Evaluation and Audit: Key Steps in Demonstrating Your Value

['Philip Calvert']

Research, Evaluation and Audit: Key Steps in Demonstrating Your Value

View independence in remote collaboration using AR.

['Matthew Tait', 'Mark Billinghurst']

View independence in remote collaboration using AR.

Book Bibliometrics - A New Perspective and Challenge in Indicator Building Based on the Book Citation Index.

['Pei-Shan Chi', 'Wouter Jeuris', 'Bart Thijs', 'Wolfgang Glänzel']

Book Bibliometrics - A New Perspective and Challenge in Indicator Building Based on the Book Citation Index.

Towards a class-based model of information organization in Wikipedia

['Michael Gilbert', 'Mark Zachry']

Towards a class-based model of information organization in Wikipedia

Utility computing has been anticipated to be the next generation of computing usage. Users have the freedom to easily switch to any commercial computing service to complete jobs whenever the need arises and simply pay only on usage, without any investment costs. A commercial computing service however has certain objectives or goals that it aims to achieve. In this paper, we identify three essential objectives for a commercial computing service: (i) meet SLA, (ii) maintain reliability, and (iii) earn profit. This leads to the problem of whether a resource management policy implemented in the commercial computing service is able to meet the required objectives or not. So, we also develop two evaluation methods that are simple and intuitive: (i) separate and (ii) integrated risk analysis to analyze the effectiveness of resource management policies in achieving the required objectives. Evaluation results based on five policies successfully demonstrate the applicability of separate and integrated risk analysis to assess policies in terms of the required objectives.

['Chee Shin Yeo', 'Rajkumar Buyya']

Integrated Risk Analysis for a Commercial Computing Service

Software-Defined Networking (SDN) is a new efficiently idea of programmable networks that separates the control plane from data plane of all network devices. Internet service provider is responsible for all the control decisions and communication among the forwarding elements from centralized controller. SDN provides the various optimized services. Quality of service (QoS) routing is a path computation method that is suitable for the different traffics generated by several applications, while utilization of network resources has increased. This agreement of service is defined by QoS requirements such as throughput, delay, jitter and packet loss etc. Multimedia applications often require assured from multi QoS constrained, causing the NP-complete problem which cannot be simply solved in polynomial time and high management complexity in the transition network. SDN is able to reduce complexity and it is used to efficiently implement traffic, hence SDN significantly values to development QoS routing. In this paper, we propose QoS routing algorithm called Quantized Level Balance (QLB) for SDN that considers one or many QoS parameters relating to the network application. To satisfy the requirements, QLB selects QoS parameters depending to the level of appropriate application service quality. We have replicated our algorithm on simulate topology with Scalable Video-streaming Evaluation Framework (SVEF). We measure the Peak Signal-to-Noise Ratio (PSNR) and Mean Opinion Score (MOS) of Scalable Video Coding (SVC) at the receiver. Our propose algorithm is improved than single-metric approach that may choose poor QoS parameter paths.

['Piyawit Tantisarkhornkhet', 'Warodom Werapun']

QLB: QoS routing algorithm for Software-Defined Networking

Hierarchical lexicon structures are not only of great importance for the nonredundant representation of lexical information, they may also contribute to the efficiency of the actual processing of natural language. Two parsing techniques that render the parsing process efficient are presented. Windowing is a technique for incrementally accessing the hierarchical lexicon. Lexical preferencing implements preferences within the parsing process as a natural consequence of the hierarchical structure of the lexicon. Within a proof-theoretic approach to Categorial Grammar it is possible to implement these techniques in a formal and principled way. Special attention is paid to idiomatic expressions.

['Erik-Jan van der Linden']

Incremental processing and the hierarchical lexicon

Computation offloading is a key concept in Mobile Cloud Computing: it concerns the capability of moving application components from a mobile device to the cloud. This technique, in general, improves the efficiency of a system, although sometimes it can lead to a performance degradation. To decide when and what to offload, we propose the use of a method for determining an optimal infinite scheduler, which is able to manage the resource assignment of components with the aim of improving the system efficiency in terms of battery consumption and time. In particular, in this paper we define a cost/reward horizon method for Mobile Cloud Computing systems specified in the language MobiCa. By means of the model checker UPPAAL, we synthesize an optimal infinite scheduler for a given system specification. We assess our approach through a case study, which highlights the importance of a scheduler for reducing energy consumption and improving system performance.

['Luca Aceto', 'Kim Guldstrand Larsen', 'Andrea Morichetta', 'Francesco Tiezzi']

A Cost/Reward Method for Optimal Infinite Scheduling in Mobile Cloud Computing

Recent years have witnessed the great success of hyper-heuristics applying to numerous real-world applications. Hyper-heuristics raise the generality of search methodologies by manipulating a set of low level heuristics (LLHs) to solve problems, and aim to automate the algorithm design process. However, those LLHs are usually parameterized, which may contradict the domain independent motivation of hyper-heuristics. In this paper, we show how to automatically maintain low level parameters (LLPs) using a hyper-heuristic with LLP adaptation (AD-HH), and exemplify the feasibility of AD-HH by adaptively maintaining the LLPs for two hyper-heuristic models. Furthermore, aiming at tackling the search space expansion due to the LLP adaptation, we apply a heuristic space reduction (SAR) mechanism to improve the AD-HH framework. The integration of the LLP adaptation and the SAR mechanism is able to explore the heuristic space more effectively and efficiently. To evaluate the performance of the proposed algorithms, we choose the p-median problem as a case study. The empirical results show that with the adaptation of the LLPs and the SAR mechanism, the proposed algorithms are able to achieve competitive results over the three heterogeneous classes of benchmark instances.

['Zhilei Ren', 'He Jiang', 'Jifeng Xuan', 'Zhongxuan Luo']

Hyper-heuristics with low level parameter adaptation

Organizational scholars have traditionally used conceptual definitions to classify situational tensions such as dialectics, dilemmas, contradictions, and paradoxes. We propose instead to use organizational members’ reactions to define and distinguish among different forms of tensions. In the present study, we propose a model in which dilemmas vary in terms of press (the sense of urgency that they invoke) and balance (the degree to which both sides of the dilemma are regarded as equally important and urgent). Depending on the degree of press and balance, organizations are predicted to undertake various response strategies. To evaluate this model, we studied a large sample of members’ descriptions of organizational responses to dilemmas in the Dutch crisis response system (N = 149). Results indicated variation in press and balance, and while some participants enacted dilemmas as choices, others enacted dilemmas in ways that acknowledged and tried to address both alternatives.

['Elizabeth J. Carlson', 'Marshall Scott Poole', 'Natalie J. Lambert', 'John C. Lammers']

A Study of Organizational Reponses to Dilemmas in Interorganizational Emergency Management

Considering Priority in Overlay Multicast Protocols Under Heterogeneous Environments

['Michael A. Bishop', 'Sanjay G. Rao', 'Kunwadee Sripanidkulchai']

Considering Priority in Overlay Multicast Protocols Under Heterogeneous Environments

Channel estimation and synchronization are crucial problems in coherent ultra wideband (UWB) systems. We develop a new channel estimation scheme that can further improve the estimation performance compared with the traditional maximum-likelihood estimator by using the second order statistic of the fading channel. The new scheme is analyzed theoretically and the performance improvement is evaluated by a computer simulation using IEEE 802.15.3a ultra-wideband channel models. Theoretical analysis and simulation results show that the new scheme improves the estimation performance of channel gains significantly at high noise power regime.

['Lei Zhou', 'Shidong Zhou', 'Yan Yao']

WLC18-1: A Novel Prior Knowledge Based ML Channel Estimator for Coherent IR-UWB Systems

We propose a fast algorithm to estimate brain tissue concentrations from conventional T1-weighted images based on a Bayesian maximum a posteriori formulation that extends the \mixel" model developed in the 90's. A key observation is the necessity to incorporate additional prior constraints to the \mixel" model for the estimation of plausible concentration maps. Experiments on the ADNI standardized dataset show that global and local brain atrophy measures from the proposed algorithm yield enhanced diagnosis testing value than with several widely used soft tissue labeling methods.

['Alexis Roche', 'Florence Forbes']

Partial volume estimation in brain MRI revisited.

We consider the problem of estimating the optimal reconstruction levels of a fixed quantizer, such as the amplitude quantization part of an analog-to-digital converter. A probabilistic transfer function model is applied for the quantizer. Two different assumptions are made for the transfer function, and an estimator based on order statistics is applied. The estimator turns out to give better results in terms of mean square error than the commonly applied sample mean. The Cramer-Rao lower bound for the estimation problem is also considered, and simulation results indicate that the derived estimator is asymptotically efficient

['Henrik Lundin', 'Mikael Skoglund', 'Peter Händel']

On the Estimation of Quantizer Reconstruction Levels

In this paper we generalize the construction of Griesmer codes of Belov type to construct $$[g_q(k,d)+t,k,d]_q$$[gq(k,d)+t,k,d]q codes with an integer $$t \ge 1$$tź1, where $$g_q(k,d)=\sum _{i=0}^{k-1} \left\lceil d/q^i \right\rceil $$gq(k,d)=źi=0k-1d/qi. This leads to the construction of several codes of length $$g_q(k,d)+1$$gq(k,d)+1, many of which are optimal. We also construct a q-divisible $$[q^2+q,5,q^2-q]_q$$[q2+q,5,q2-q]q code through projective geometry. As a projective dual of the code, we construct optimal codes, giving $$n_q(5,d)=g_q(5,d)+1$$nq(5,d)=gq(5,d)+1 for $$q^4-q^3-q^2+1 \le d \le q^4-q^3-2q$$q4-q3-q2+1≤d≤q4-q3-2q, $$q \ge 3$$qź3, where $$n_q(k,d)$$nq(k,d) is the minimum length n for which an $$[n,k,d]_q$$[n,k,d]q code exists.

['Yuuki Kageyama', 'Tatsuya Maruta']

On the geometric constructions of optimal linear codes

TimeNET is a software package for modeling and performance evaluation with non-Markovian Petri nets. Concepts and implementation of the simulation component of this tool are introduced. The paper focuses on a reliable statistical analysis and the application of variance reduction techniques in a parallel, distributed simulation framework. It examines the application of variance reduction with control variates and shows an approach for their automatic selection in Petri net models. An example demonstrates the gain of variance reduction and parallelization. >

['Christian Kelling']

TimeNET-Sim-a parallel simulator for stochastic Petri nets

Academic E-Books: Publishers, Librarians, and Users. Suzanne M. Ward, Robert S. Freeman, and Judith M. Nixon, eds. West Lafayette, Ind.: Purdue University Press, 2016. 360p. Paper, $29.95 (ISBN 978-1-5575-3727-0). LC 2015027357.

['Andrea Kosavic']

Academic E-Books: Publishers, Librarians, and Users. Suzanne M. Ward, Robert S. Freeman, and Judith M. Nixon, eds. West Lafayette, Ind.: Purdue University Press, 2016. 360p. Paper, $29.95 (ISBN 978-1-5575-3727-0). LC 2015027357.

This paper covers a sales forecasting problem on e-commerce sites. To predict product sales, we need to understand customers' browsing behavior and identify whether it is for purchase purpose or not. For this goal, we propose a new customer model, B2P, of aggregating predictive features extracted from customers' browsing history. We perform experiments on a real world e-commerce site and show that sales predictions by our model are consistently more accurate than those by existing state-of-the-art baselines.

['Jinyoung Yeo', 'Sungchul Kim', 'Eunyee Koh', 'Seung-won Hwang', 'Nedim Lipka']

Browsing2purchase: Online Customer Model for Sales Forecasting in an E-Commerce Site

Recovering Device Sensitivities with Quadratic Programming.

['Graham D. Finlayson', 'Steven D. Hordley', 'Paul M. Hubel']

Recovering Device Sensitivities with Quadratic Programming.

Force information is often required for tele-operation systems and virtual reality. Conventional force displays are active systems with actuators. This, however, is inherently active, so that it may become a danger. Consequently, passive force display is an effective method for assuring safety. The authors developed a brake using ER (electrorheological) fluid and passive force display using ER brakes. They discuss two degree of freedom passive force display and basic control experiments.

['Masamichi Sakaguchi', 'Junji Furusho', 'Naoyuki Takesue']

Passive force display using ER brakes and its control experiments

Non-Obvious Conceptual Structure: Evidence from Weak Definites.

['Sandeep Prasada', 'Emma Briggs']

Non-Obvious Conceptual Structure: Evidence from Weak Definites.

High rate transmission over power lines imposes stringent requirements in coding and equalization, the chief impairments being severe signal attenuation and impulsive noise. Yet, transmission requirements over this medium have reached several Mbit/sec to compete with other types of access. In this paper, we propose a novel PAM-based coded modulation scheme that is well suited to meeting such constraints. The proposed scheme combines Low Density Parity Check (LDPC) codes and maximum-distance separable block codes to achieve high spectral efficiency, low decoding complexity, and a high degree of immunity to impulse noise. To achieve better immunity to burst and impulse noise, a novel interleaving scheme is proposed. To achieve good performance in the presence of inter-symbol interference, the proposed coset-coding is combined with Tomlinson-Harashima precoding and spectral shaping at the transmitter.

['Raju Hormis', 'Inaki Berenguer', 'Xiaodong Wang']

Baseband Transmission on Power Line Channels with LDPC Coset Codes

Let P be a (non-necessarily convex) embedded polyhedron in R3, with its vertices on the boundary of an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, . . ., Cn with disjoint interiors, whose vertices are the vertices of P. Suppose that there exists an ellipsoid which contains no vertex of P but intersects all the edges of the Ci. Then P is infinitesimally rigid. The proof is based on some geometric properties of hyperideal hyperbolic polyhedra.

['Jean-Marc Schlenker']

A Rigidity Criterion for Non-Convex Polyhedra

One of the hardest problems in computer science is the prob- lem of gate-e-cient implementation. Such optimizations are particularly important in industrial hardware implementations of standard crypto- graphic algorithms. In this paper we focus on optimizing some small circuits such as S-boxes in cryptographic algorithms. We consider the no- tion of Multiplicative Complexity, a new important notion of complexity introduced in 2008 by Boyar and Peralta and applied to flnd interesting optimizations for the S-box of the AES cipher (13,16,15). We applied this methodology to produce a compact implementation of several ciphers. In this short paper we report our results on PRESENT and GOST, two block ciphers known for their exceptionally low hardware cost. This kind of representation seems to be very promising in implementations aiming at preventing side channel attacks on cryptographic chips such as DPA. More importantly, we postulate that this kind of minimality is also an important and interesting tool in cryptanalysis.

['Nicolas T. Courtois', 'Daniel Hulme', 'Theodosis Mourouzis']

Solving Circuit Optimisation Problems in Cryptography and Cryptanalysis.

In Advanced Driving Assistance Systems ADASs, for traffic safety, one of main application is to notify the driver regarding the important traffic information such as presence of a pedestrian or information regarding traffic signals. In a particular driving scenario, the amount of information related to the situation available to the driver can be judged by monitoring the internal information for example driver's gaze and external information for example information regarding forward traffic. Therefore, to provide sufficient information to the driver regarding a driving scenario it is essential to integrate the internal and external information which is lacking in the current ADASs. In this work, we employ 3D pose estimate algorithm POSIT for estimation of driver's attention area. In order to estimate the distributions corresponding to the forward traffic we employ both bottom-up saliency map model and a top-down process using HOG pedestrian detection. The integration of internal and external information is done using the mutual information.

['Seonggyu Kim', 'Mallipeddi Rammohan', 'Minho Lee']

In-Attention State Monitoring Based on Integrated Analysis of Driver's Headpose and External Environment

This paper reports on a series of three similar graph drawing empirical studies, and describes the results of investigating subtle variations on the experimental method. Its purpose is two-fold: to report the results of the experiments, as well as to illustrate how easy it is to inadvertently make conclusions that may not stand up to scrutiny. While the results of the initial experiment were validated, instances of speculative conclusions and inherent bias were identified. This research highlights the importance of stating the limitations of any experiment, being clear about conclusions that are speculative, and not assuming that even minor experimental decisions will not affect the results.

['Helen C. Purchase']

Sketched Graph Drawing: A Lesson in Empirical Studies

Integrated care pathways (ICPs), a fine-grained form of medical guideline including the explicit recording of any deviation, or ‘variance’, could serve as a rich source of data for research. Not only do they incorporate a wealth of operational knowledge, but feeding the results of the analysis of variance into the development of a pathway could be an effective way of capturing evidence from practice. In our principal case study we propose a system for extracting data from care pathways with the aid of ontologies, and a method for inferring ICPs from other patient records, combining these with data collected for retrospective and prospective studies in preimplantation genetic diagnosis (PGD) for assisted reproduction.

['Mark Olive', 'Alison Lashwood', 'Tony Solomonides']

Care pathway records and variance data: Enabling research through the use of ontologies

An essential step in comparative reconstruction is to align corresponding phonological segments in the words being compared. To do this, one must search among huge numbers of potential alignments to find those that give a good phonetic fit. This is a hard computational problem, and it becomes exponentially more difficult when more than two strings are being aligned. In this paper I extend the guided-search alignment algorithm of Covington (Computational Linguistics, 1996) to handle more than two strings. The resulting algorithm has been implemented in Prolog and gives reasonable results when tested on data from several languages.

['Michael A. Covington']

Alignment of Multiple Languages for Historical Comparison

US Senate is the venue of political debates where the federal bills are formed and voted. Senators show their support/opposition along the bills with their votes. This information makes it possible to extract the polarity of the senators. We use signed bipartite graphs for modeling debates, and we propose an algorithm for partitioning both the senators, and the bills comprising the debate into binary opposing camps. Simultaneously, our algorithm scales both the senators and the bills on a univariate scale. Using this scale, a researcher can identify moderate and partisan senators within each camp, and polarizing vs. unifying bills. We applied our algorithm on all the terms of the US Senate to the date for longitudinal analysis and developed a web based interactive user interface www.PartisanScale.com to visualize the analysis.

['Sedat Gokalp', 'Hasan Davulcu']

Partisan scale

Local Search Approach to Genetic Programming for RF-PAs Modeling Implemented in FPGA

['J. R. Cárdenas Valdez', 'Emigdio Z-Flores', 'José Cruz Núñez Pérez', 'Leonardo Trujillo']

Local Search Approach to Genetic Programming for RF-PAs Modeling Implemented in FPGA

Sensor scheduling is essential to collaborative target tracking in Wireless Sensor Networks (WSNs). In this paper, we present a Multi-step Adaptive Sensor Scheduling algorithm (MASS) by selecting the next tasking sensor and its associated sampling interval based on the prediction of tracking accuracy and energy cost over a finite horizon of steps. MASS adopts alternative tracking mode for each prediction step, i.e., the fast tracking mode (FTM) or the tracking maintenance mode (TMM) dependent on whether the estimated or predicted tracking accuracy is satisfactory. The Best Sensor Schedule Sequence (BSSS) is found by searching and comparing the Candidate Sensor Schedule Sequences (CSSSs) at two levels, i.e., the logical tracking mode level which is simplely defined on multi-step tracking modes and the physical quantity performance level by considering the tradeoff between tracking accuracy and energy cost. MASS employs the extended Kalman filter (EKF) algorithm to predict the tracking accuracy and an energy consumption model to predict the energy cost. Simulation results show that, compared with the traditional non-adaptive sensor scheduling algorithm and the single-step adaptive sensor scheduling algorithm, MASS can achieve fast tracking speed and superior energy efficiency without degrading the tracking accuracy.

['Wendong Xiao', 'Lihua Xie', 'Jianfeng Chen', 'Louis Shue']

Multi-Step Adaptive Sensor Scheduling for Target Tracking in Wireless Sensor Networks

This work develops a low-complexity method that integrates the inverse transform and downscaling. According to the application requirement, the reduction ratios of the frame width and length are adopted at the matrix computation of the inverse transform. Since a small matrix is employed to compute the inverse transform and downscaling, the non-zero high-frequency components are compensated at the spatial and frequency domains. As compared to the conventional methods, the computational complexity of proposed method with the frequency-domain compensation can be reduced effectively under the similar decoded picture quality. Particularly, the proposed method can meet various downscaling ratios to accomplish low-complexity transforms for mobile video applications.

['Meng-Lin Hsia', 'Chih-Feng Tseng', 'Meng-Hsuan Chan', 'Oscal T.-C. Chen']

Low-complexity frame-size down-scaling integrated with IDCT

Designing Natural User Interfaces Scenarios for All and for Some: An Analysis Informed by Organizational Semiotics Artifacts

['Vanessa Regina Margareth Lima Maike', 'Samuel B. Buchdid', 'M. Cecília C. Baranauskas']

Designing Natural User Interfaces Scenarios for All and for Some: An Analysis Informed by Organizational Semiotics Artifacts

Modern day data centers coordinate hundreds of thousands of heterogeneous tasks and aim at delivering highly reliable cloud computing services. Although offering equal reliability to all users benefits everyone at the same time, users may find such an approach either inadequate or too expensive to fit their individual requirements, which may vary dramatically. In this paper, we propose a novel method for providing elastic reliability optimization in cloud computing. Our scheme makes use of peer-to-peer checkpointing and allows user reliability levels to be jointly optimized based on an assessment of their individual requirements and total available resources in the data center. We show that the joint optimization can be efficiently solved by a distributed algorithm using dual decomposition. The solution improves resource utilization and presents an additional source of revenue to data center operators. Our validation results suggest a significant improvement of reliability over existing schemes.

['Juzi Zhao', 'Yu Xiang', 'Tian Lan', 'H. Howie Huang', 'Suresh Subramaniam']

Elastic Reliability Optimization Through Peer-to-Peer Checkpointing in Cloud Computing

The experience of motion sickness in a virtual environment may be measured through pre- and post-experiment self-reported questionnaires such as the Simulator Sickness Questionnaire (SSQ). Although research provides converging evidence that users of virtual environments can experience motion sickness, there have been no controlled studies to determine to what extent the user’s subjective response is a demand characteristic resulting from pre- and post-test measures. In this study, subjects were given either SSQ’s both pre and post virtual environment immersion, or only post immersion. This technique was used to test for contrast effects due to demand characteristics in which administration of the questionnaire itself suggests to the participant that the virtual environment may produce motion sickness. Results indicate that reports of motion sickness after immersion in a virtual environment are much greater when both pre and post questionnaires are given than when only a post test questionnaire is used. The implications for assessments of motion sickness in virtual environments are discussed.

['Sean D. Young', 'Bernard D. Adelstein', 'Stephen R. Ellis']

Demand Characteristics of a Questionnaire Used to Assess Motion Sickness in a Virtual Environment

With the implementation of the Bologna Process several challenges have been posed to higher education#R##N##R##N#institution, particularly in Portugal. One of the main implications is related to the change of the paradigm of#R##N##R##N#a teacher centered education, to a paradigm that is student centered. This change implies the change of the#R##N##R##N#way to assess courses in higher education institutions. Continuous and formative assessments emerged as#R##N##R##N#the focus, catalyzed by electronic assessment, or e-assessment. This paper presents a case of the#R##N##R##N#implementation of an e-assessment strategy, implemented in order to allow continuous, formative#R##N##R##N#assessment in numerous mathematics classes using multiple-choice questions tests implement in Moodle#R##N##R##N#open-source learning management system. The implementation can be considered a success.

['José Manuel Azevedo']

e-Assessment in Mathematics Courses with Multiple-choice Questions Tests

We study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H (the backbone) of G, a backbone coloring for G and H is a proper vertex coloring V → {1,2,...} in which the colors assigned to adjacent vertices in H differ by at least two. We concentrate on the cases where the backbone is either a spanning tree or a spanning path. For tree backbones of G, the number of colors needed for a backbone coloring of G can roughly differ by a multiplicative factor of at most 2 from the chromatic number X(G); for path backbones this factor is roughly 3/2. In the special case of split graphs G, the difference from X(G) is at most an additive constant 2 or 1, for tree backbones and path backbones, respectively. The computational complexity of the problem 'Given a graph G, a spanning tree T of G, and an integer , is there a backbone coloring for G and T with at most colors?' jumps from polynomial to NP-complete between = 4 (easy for all spanning trees) and = 5 (difficult even for spanning paths).

['Hajo Broersma', 'Fedor V. Fomin', 'Petr A. Golovach', 'Gerhard J. Woeginger']

Backbone colorings for networks

We show how the database community's notion of a generic query interface for data aggregation can be applied to ad-hoc networks of sensor devices. As has been noted in the sensor network literature, aggregation is important as a data reduction tool; networking approaches, however, have focused on application specific solutions, whereas our in-network aggregation approach is driven by a general purpose, SQL-style interface that can execute queries over any type of sensor data while providing opportunities for significant optimization. We present a variety of techniques to improve the reliability and performance of our solution. We also show how grouped aggregates can be efficiently computed and offer a comparison to related systems and database projects.

['Samuel Madden', 'Robert Szewczyk', 'Michael J. Franklin', 'David E. Culler']

Supporting aggregate queries over ad-hoc wireless sensor networks

Cooperation enforcement is one of the key issues in ad hoc networks. In this paper we proposes a new strategy driven approach that aims at discouraging selfish behavior among network participants. Each node is using a strategy that defines conditions under which packets are being forwarded. Such strategy is based on the notion of trust and activity of the source node of the packet. This way network participants are forced to forward packets and to reduce the amount of time spent in a sleep mode. To evaluate strategies we use a new game theory based model of an ad hoc network. A genetic algorithm (GA) is applied to find good strategies. Experimental results show that our approach makes selfish behavior unattractive.

['Marcin Seredynski', 'Pascal Bouvry', 'Mieczyslaw A. Klopotek']

Preventing selfish behavior in Ad Hoc networks

Feedforward artificial neural networks are susceptible to thermal noise when implemented as analog or digital hardware. Thus to study of the effect of noise on neural hardware, noise metrics have to be identified. In this paper, five new metrics are prepared and shown to be relevant for noise modeling in the neural hardware.

['Amit Prakash Singh', 'Chandra Shekhar Rai', 'Pravin Chandra']

Metrics for measurement of additive noise to weight in sigmoidal FFANNs

A band-limited signal can be represented by the real and complex zeros of the signal. By simple invertible techniques, it is possible to convert the signal into another one which has only real (physical) zeros. Based on a zero-based representation, a spectrum analyzer is proposed. The spectrum analyzer samples the zero crossings of the signal waveform and uses this information to determine the discrete Fourier transform coefficients in software. The zero-based spectrum analyzer alleviates many of the shortcomings of the conventional A/D converter-based spectrum analyzer. In particular, the hardware is simple and the dynamic range and speed limitations of the A/D converter are reduced. The results of a computer simulation study of the error aspects of the spectrum analyzer are presented.

['Steven M. Kay', 'R. Sudhaker']

A zero crossing-based spectrum analyzer

Hybrid input/output automata provide a language for the description and analysis of hybrid systems. In this paper, we develop a notion of approximate simulation relation for metric hybrid input/output automata, which is an extension classic simulation relation in hybrid input/output automata, and investigate some interesting results. In addition, we discuss a particular kind of approximation simulation relation, i.e. approximate refinement. Moreover, we show how to adopt approximate synchronization methods to guarantee substitutive under the condition of approximate simulation.

['Haiyu Pan', 'Min Zhang', 'Yixiang Chen']

Approximate Simulation for Metric Hybrid Input/Output Automata

This paper presents the results of video based human robot interaction (HRI) trials which investigated people's perceptions of different robot appearances and associated attention seeking features and behaviors displayed by the robot. The methodological approach highlights the "holistic" and embodied nature of robot appearance and behavior. Results show that people tend to rate a particular behavior less favorably when the behavior is not consistent with the robot's appearance. It is shown how participants' ratings of robot dynamic appearance are influenced by the robot's behavior. Relating participants' dynamic appearance ratings of individual robots to independently rated static appearance provides support for the left hand side of Mori's proposed "uncanny valley" diagram. We exemplify how to rate individual elements of a particular robot's behavior and then assess the contribution of those elements to the overall perception of the robot by people. Suggestions for future work are outlined.

['Michael L. Walters', 'Kerstin Dautenhahn', 'R. Te Boekhorst', 'Kheng Lee Koay', 'Sarah Woods']

Exploring the Design Space of Robot Appearance and Behavior in an Attention-Seeking `Living Room' Scenario for a Robot Companion

In this paper, we identified the challenges and requirements for the waveform design of the fifth generation mobile communication networks (5G) and compared Orthogonal frequency-division multiplexing (OFDM) based waveforms with Filter Bank Multicarrier (FBMC) based ones. Recently it has been shown that Quadrature-Amplitude Modulation (QAM) transmission and reception can be enabled in FBMC by using multiple prototype filters, resulting in a new waveform: QAM-FBMC. Here, the transceiver architecture and signal model of QAM-FBMC are presented and channel estimation error and RF impairment, e.g., phase noise, are modeled. In addition, initial evaluation is made in terms of out-of-band (OOB) emission and complexity. The simulation results show that QAM-FBCM can achieve the same BER performance as cyclic-prefix (CP) OFDM without spectrum efficiency reduction due to the adding of CP. Different equalization schemes are evaluated and the effect of channel estimation error is investigated. Moreover, effects of the phase noise are evaluated and QAM-FBMC is shown to be robust to the phase noise.

['Yinan Qi', 'Mohammed Al-Imari']

An enabling waveform for 5G — QAM-FBMC: Initial analysis

SSH and AKA are recent, practical protocols for secure connections over an otherwise unprotected network. The paper shows that, despite the use of public-key cryptography, SSH and AKA do not provide authentication as intended. The flaws of SSH and AKA can be viewed as the result of their disregarding a basic principle for the design of sound authentication protocols: the principle that messages should be explicit.

['Martín Abadi']

Explicit communication revisited: two new attacks on authentication protocols

CertainLogic : a logic for modeling trust and uncertainty (short paper)

['Sebastian Ries', 'Sheikh Mahbub Habib', 'Max Mühlhäuser', 'Vijay Varadharajan']

CertainLogic : a logic for modeling trust and uncertainty (short paper)

Before surface mount components can be placed on a circuit board, it is necessary to print solder paste onto pads. The paste is then melted to make an electrical connection (reflow). A screen printing process is used to print the solder paste onto the board. This is a complicated process with a large number of input parameters. Some of these parameters can be controlled and it is the purpose of this work to investigate control of the process based on measurement of the output shape of the printed paste. The shape is measured using a laser range scanner Principal Component Analysis (PCA) is proposed as a tool for describing solder paste shape with a small number of parameters. This paper discusses the use of PCA for shape analysis in range images as well as explaining how such a description can be incorporated into a process control loop.

['Robert C. Crida', 'Andrew J. Stoddart', 'John Illingworth']

Using PCA to model shape for process control

We introduce a novel training principle for generative probabilistic models that is an alternative to maximum likelihood. The proposed Generative Stochastic Networks (GSN) framework generalizes Denoising Auto-Encoders (DAE) and is based on learning the transition operator of a Markov chain whose stationary distribution estimates the data distribution. The transition distribution is a conditional distribution that generally involves a small move, so it has fewer dominant modes and is unimodal in the limit of small moves. This simplies the learning problem, making it less like density estimation and more akin to supervised function approximation, with gradients that can be obtained by backprop. The theorems provided here provide a probabilistic interpretation for denoising autoencoders and generalize them; seen in the context of this framework, auto-encoders that learn with injected noise are a special case of GSNs and can be interpreted as generative models. The theorems also provide an interesting justication for dependency networks and generalized pseudolikelihood and dene an appropriate joint distribution and sampling mechanism, even when the conditionals are not consistent. GSNs can be used with missing inputs and can be used to sample subsets of variables given the rest. Experiments validating these theoretical results are conducted on both synthetic datasets and image datasets. The experiments employ a particular architecture that mimics the Deep Boltzmann Machine Gibbs sampler but that allows training to proceed with backprop through a recurrent neural network with noise injected inside and without the need for layerwise pretraining.

['Guillaume Alain', 'Yoshua Bengio', 'Li Yao', 'Jason Yosinski', 'Eric Thibodeau-Laufer', 'Saizheng Zhang', 'Pascal Vincent']

GSNs : Generative Stochastic Networks

We define the magic-sets transformation for traditional relational systems (with duplicates, aggregation and grouping), as well as for relational systems extended with recursion. We compare the magic-sets rewriting to traditional optimization techniques for nonrecursive queries, and use performance experiments to argue that the magic-sets transformation is often a better optimization technique.

['Inderpal Singh Mumick', 'Sheldon J. Finkelstein', 'Hamid Pirahesh', 'Raghu Ramakrishnan']

Magic is relevant

A pair of pants is a genus zero orientable surface with three boundary components. A pants decomposition of a surface is a finite collection of unordered pairwise disjoint simple closed curves embedded in the surface that decompose the surface into pants. In this paper, we present two Morse theory based algorithms for pants decomposition of a surface mesh. Both algorithms operates on a choice of an appropriate Morse function on the surface. The first algorithm uses this Morse function to identify handles that are glued systematically to obtain a pants decomposition. The second algorithm uses the Reeb graph of the Morse function to obtain a pants decomposition. Both algorithms work for surfaces with or without boundaries. Our preliminary implementation of the two algorithms shows that both algorithms run in much less time than an existing state-of-the-art method, and the Reeb graph based algorithm achieves the best time efficiency. Finally, we demonstrate the robustness of our algorithms against noise.

['Mustafa Hajij', 'Tamal K. Dey', 'Xin Li']

Segmenting a Surface Mesh into Pants Using Morse Theory

Analysis of Link Formation, Persistence and Dissolution in NetSense Data

['Ashwin Bahulkar', 'Yuxiao Dong', 'Yang Yang', 'Boleslaw K. Szymanski', 'Nitesh V. Chawla', 'Omar Lizardo']

Analysis of Link Formation, Persistence and Dissolution in NetSense Data

A 9-bit 80 MS/s successive approximation register analog-to-digital converter (ADC), which is suitable for low power and a small area, is presented. The 9-bit capacitor array consists of only 16 unit capacitors and a coupling capacitor due to the proposed binary-weighted split-capacitor arrays with a merged-capacitor switching technique. The proposed ADC includes a comparator with offset cancellation and uses digital calibration for error correction. The ADC is implemented in a 65-nm complimentary metal-oxide-semiconductor technology and occupies an active area of 0.068 mm 2 with a reference buffer. The differential and integral nonlinearities of the ADC are less than 0.37 and 0.40 LSB, respectively. The ADC shows a signal-to-noise-distortion ratio of 50.71 dB, a spurious-free dynamic range of 66.72 dB, and an effective number of bits of 8.13 bits with a 78 MHz sinusoidal input at 80 MS/s. The ADC consumes 3.4 mW with the reference buffer at a 1.0-V supply and achieves a figure of merit of 78 fJ/conversion step.

['Young-Kyun Cho', 'Young-Deuk Jeon', 'Jaewon Nam', 'Jong-Kee Kwon']

A 9-bit 80 MS/s Successive Approximation Register Analog-to-Digital Converter With a Capacitor Reduction Technique