OpenRaiser/Intern-Atlas huggingface dataset:
Classification of ST and Q Type MI variant using thresholding and neighbourhood estimation method after cross wavelet based analysis
Venue: arXiv cs.OH 2013
Year: 2013

This paper proposes a cross wavelet transform based method for Electrocardiogram signal analysis where parameters are identified from wavelet cross spectrum and wavelet cross coherence of ECG patterns. Most of the ECG analysing systems use explicit time plane features for cardiac pattern classification. Application of this proposed technique for classification eliminates the need for extraction of various explicit time plane features and hence reduces the complexity of the system. The cross-correlation is the measure of similarity between two waveforms or two time series and the cross examination reveals localized similarities in time and scale. Parameters extracted from Wavelet Cross Spectrum (WCS) and Wavelet Coherence (WCOH) is used for classification. A pathologically varying pattern in QT zone of inferior lead III shows the presence of Inferior Myocardial Infarction (IMI). The Cross Wavelet Transform and Wavelet Coherence is used for the cross examination of single normal and abnormal (IMI) beats. A normal template beat is selected as the absolute normal pattern. Computation of the WCS and WCOH of the selected normal template and various other normal and abnormal beats reveals the existence of variation among patterns under study. The Wavelet cross spectrum and Wavelet coherence of various ECG patterns shows distinguishing characteristics over two specific regions R1 and R2, where R1 is the QRS complex location and R2 is the T wave region. Parameters are identified for classification of Type 1 IMI (non Q type, with ST elevation and attenuated QRS complex) and Type 2 IMI (Q type MI with deep Q and inverted T) and normal subjects. Accuracy of the proposed classification method is obtained as 99.43% for normal and abnormal class and 88.5% and 87.02% for Type I and Type II respectively.
Criticality estimation of IT business functions with the Business Continuity Testing Points method for implementing effective recovery exercises of crisis scenarios
Venue: arXiv cs.OH 2013
Year: 2013

The primary goal of the present paper is the introduction of a new approach of defining IT unit business functions exact criticality levels and respectively categorize them to the appropriate recovery tests, prior to their thorough documentation which includes actual desired recovery time frames. The method is entitled as Business Continuity Testing Points and it is based on the concept of Use Case Points, a fundamental project estimation tool utilized for sizing of object-oriented system development. The aim of the contribution is to ameliorate the existing manual way of determining recovery time of IT business functions that is based exclusively on experience of IT personnel, by introducing a calculation method of multiple factors that can negatively affect the recovery process. The elimination of damage as a result of tested immediate response action in a crisis situation that disrupts core IT operations constitutes the aimed advantage of the proposed contribution
Data Challenges in High-Performance Risk Analytics
Venue: arXiv cs.DC 2013
Year: 2013

Risk Analytics is important to quantify, manage and analyse risks from the manufacturing to the financial setting. In this paper, the data challenges in the three stages of the high-performance risk analytics pipeline, namely risk modelling, portfolio risk management and dynamic financial analysis is presented.
The Prediction value
Venue: arXiv cs.GT 2013
Year: 2013

We introduce the prediction value (PV) as a measure of players' informational importance in probabilistic TU games. The latter combine a standard TU game and a probability distribution over the set of coalitions. Player $i$'s prediction value equals the difference between the conditional expectations of $v(S)$ when $i$ cooperates or not. We characterize the prediction value as a special member of the class of (extended) values which satisfy anonymity, linearity and a consistency property. Every $n$-player binomial semivalue coincides with the PV for a particular family of probability distributions over coalitions. The PV can thus be regarded as a power index in specific cases. Conversely, some semivalues -- including the Banzhaf but not the Shapley value -- can be interpreted in terms of informational importance.
Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization
Venue: arXiv cs.LG 2013
Year: 2013

Hard Thresholding Pursuit (HTP) is an iterative greedy selection procedure for finding sparse solutions of underdetermined linear systems. This method has been shown to have strong theoretical guarantee and impressive numerical performance. In this paper, we generalize HTP from compressive sensing to a generic problem setup of sparsity-constrained convex optimization. The proposed algorithm iterates between a standard gradient descent step and a hard thresholding step with or without debiasing. We prove that our method enjoys the strong guarantees analogous to HTP in terms of rate of convergence and parameter estimation accuracy. Numerical evidences show that our method is superior to the state-of-the-art greedy selection methods in sparse logistic regression and sparse precision matrix estimation tasks.
Scheduling a Cascade with Opposing Influences
Venue: arXiv cs.GT 2013
Year: 2013

Adoption or rejection of ideas, products, and technologies in a society is often governed by simultaneous propagation of positive and negative influences. Consider a planner trying to introduce an idea in different parts of a society at different times. How should the planner design a schedule considering this fact that positive reaction to the idea in early areas has a positive impact on probability of success in later areas, whereas a flopped reaction has exactly the opposite impact? We generalize a well-known economic model which has been recently used by Chierichetti, Kleinberg, and Panconesi (ACM EC'12). In this model the reaction of each area is determined by its initial preference and the reaction of early areas. We generalize previous works by studying the problem when people in different areas have various behaviors. We first prove, independent of the planner's schedule, influences help (resp., hurt) the planner to propagate her idea if it is an appealing (resp., unappealing) idea. We also study the problem of designing the optimal non-adaptive spreading strategy. In the non-adaptive spreading strategy, the schedule is fixed at the beginning and is never changed. Whereas, in adaptive spreading strategy the planner decides about the next move based on the current state of the cascade. We demonstrate that it is hard to propose a non-adaptive spreading strategy in general. Nevertheless, we propose an algorithm to find the best non-adaptive spreading strategy when probabilities of different behaviors of people in various areas drawn i.i.d from an unknown distribution. Then, we consider the influence propagation phenomenon when the underlying influence network can be any arbitrary graph. We show it is $\#P$-complete to compute the expected number of adopters for a given spreading strategy.
Design of Fast Response Smart Electric Vehicle Charging Infrastructure
Venue: arXiv cs.SY 2013
Year: 2013

The response time of the smart electrical vehicle (EV) charging infrastructure is the key index of the system performance. The traffic between the smart EV charging station and the control center dominates the response time of the smart charging stations. To accelerate the response of the smart EV charging station, there is a need for a technology that collects the information locally and relays it to the control center periodically. To reduce the traffic between the smart EV charger and the control center, a Power Information Collector (PIC), capable of collecting all the meters power information in the charging station, is proposed and implemented in this paper. The response time is further reduced by pushing the power information to the control center. Thus, a fast response smart EV charging infrastructure is achieved to handle the shortage of energy in the local grid.
On a Flywheel-Based Regenerative Braking System for Regenerative Energy Recovery
Venue: arXiv cs.SY 2013
Year: 2013

This paper presents a unique flywheel-based regenerative energy recovery, storage and release system developed at the author's laboratory. It can recover and store regenerative energy produced by braking a motion generator with intermittent rotary velocity such as the rotor of a wind turbogenerator subject to intermittent intake wind and the axels of electric and hybrid gas-electric vehicles during frequent coasting and braking. Releasing of the stored regenerative energy in the flywheel is converted to electricity by the attached alternator. A proof-of-concept prototype called the SJSU-RBS was designed, built and tested by author's students with able assistance of a technical staff in his school.
Security versus Reliability Analysis of Opportunistic Relaying
Venue: arXiv cs.IT 2013
Year: 2013

Physical-layer security is emerging as a promising paradigm of securing wireless communications against eavesdropping between legitimate users, when the main link spanning from source to destination has better propagation conditions than the wiretap link from source to eavesdropper. In this paper, we identify and analyze the tradeoffs between the security and reliability of wireless communications in the presence of eavesdropping attacks. Typically, the reliability of the main link can be improved by increasing the source's transmit power (or decreasing its date rate) to reduce the outage probability, which unfortunately increases the risk that an eavesdropper succeeds in intercepting the source message through the wiretap link, since the outage probability of the wiretap link also decreases when a higher transmit power (or lower date rate) is used. We characterize the security-reliability tradeoffs (SRT) of conventional direct transmission from source to destination in the presence of an eavesdropper, where the security and reliability are quantified in terms of the intercept probability by an eavesdropper and the outage probability experienced at the destination, respectively. In order to improve the SRT, we then propose opportunistic relay selection (ORS) and quantify the attainable SRT improvement upon increasing the number of relays. It is shown that given the maximum tolerable intercept probability, the outage probability of our ORS scheme approaches zero for $N \to \infty$, where $N$ is the number of relays. Conversely, given the maximum tolerable outage probability, the intercept probability of our ORS scheme tends to zero for $N \to \infty$.
Third Order Intermodulation Power Estimation for N Sinusoidal Channels
Venue: arXiv cs.SY 2013
Year: 2013

In this paper analysis is given to find the third order intermodulation power given sinusoids are fed into a nonlinear device. A simple expression of the third order intermodulation power is given for the case that the center frequencies of the input sinusoids are equally spaced. Further, if the powers of the signals are equal, the expression becomes a closed form expression. The analysis will be helpful for communication system engineering in estimating the adjacent channel interference due to nonlinearity. Numerical results are presented for various values of (number of input channels). Though the analysis assumes the input signals to be sinusoids without phase modulation, the third order intermodulation power estimate serves as a good estimate for link budget computation purpose. For the case that the center frequencies of the input sinusoids are not spaced equally, the analysis can still highly likely be applied if we insert pseudo channels in between the real channels so that all (real and pseudo) channels are spaced equally (or approximately equally for approximation). In this case, the pseudo channel powers are set to zero so that the interference powers due to the pseudo channels will not be included in the analysis. In other words, the analysis is highly likely applicable without the constraint of the input channel center frequencies being equally likely. Simulations are also provided for the case that the input sinusoids are QPSK modulated.
Platform-Based Design Methodology and Modeling for Aircraft Electric Power Systems
Venue: arXiv cs.SY 2013
Year: 2013

In an aircraft electric power system (EPS), a supervisory control unit must actuate a set of switches to distribute power from generators to loads, while satisfying safety, reliability and real-time performance requirements. To reduce expensive re-design steps in current design methodologies, such a control problem is generally addressed based on minor incremental changes on top of consolidated solutions, since it is difficult to estimate the impact of earlier design decisions on the final implementation. In this paper, we introduce a methodology for the design space exploration and virtual prototyping of EPS supervisory control protocols, following the platform-based design (PBD) paradigm. Moreover, we describe the modeling infrastructure that supports the methodology. In PBD, design space exploration is carried out as a sequence of refinement steps from the initial specification towards a final implementation, by mapping higher-level behavioral models into a set of library components at a lower level of abstraction. In our flow, the system specification is captured using SysML requirement and structure diagrams. State-machine diagrams enable verification of the control protocol at a high level of abstraction, while lowerlevel hybrid models, implemented in Simulink, are used to verify properties related to physical quantities, such as time, voltage and current values. The effectiveness of our approach is illustrated on a prototype EPS control protocol design.
An energy function and its application to the periodic behavior of k-reversible processes
Venue: arXiv cs.DS 2013
Year: 2013

We consider the graph dynamical systems known as k-reversible processes. In such processes, each vertex in the graph has one of two possible states at each discrete time step. Each vertex changes its state between the current time and the next if and only if it currently has at least k neighbors in a state different than its own. For such processes, we present a monotonic function similar to the decreasing energy functions used to study threshold networks. Using this new function, we show an alternative proof for the maximum period length in a k-reversible process and provide better upper bounds on the transient length in both the general case and the case of trees.
Agent Approach in Support of Enterprise Application Integration
Venue: arXiv cs.MA 2013
Year: 2013

The present approach highlights the synergies between application integration and interaction protocols. Since both fields have advanced in different directions, a number of important technical problems can be addressed by their proper synthesis. In our previous work, we proposed a methodological approach based on Interaction Protocols for Enterprise Applica tion Integration (EAI). This approach permits to specify MAS (Multi-Agent System) interaction protocols, verify their behavior and use them to integrate multiple business applications. The result of the proposed approach is a validated interaction protocol. Based on this protocol, we define in this paper, an agent- based architecture for the EAI. It includes all the concepts nec- essary to support communication and coordination mechanisms such as inter-agent and agent-Web services communication.
Minimum Delay Huffman Code in Backward Decoding Procedure
Venue: arXiv cs.IT 2013
Year: 2013

For some applications where the speed of decoding and the fault tolerance are important, like in video storing, one of the successful answers is Fix-Free Codes. These codes have been applied in some standards like H.263+ and MPEG-4. The cost of using fix-free codes is to increase the redundancy of the code which means the increase in the amount of bits we need to represent any peace of information. Thus we investigated the use of Huffman Codes with low and negligible backward decoding delay. We showed that for almost all cases there is always a Minimum Delay Huffman Code for a given length vector. The average delay of this code for anti-uniform sources is calculated, that is in agreement with the simulations, and it is shown that this delay is one bit for large alphabet sources. Also an algorithm is proposed which will find the minimum delay code with a good performance.
Channel and Noise Models for Nonlinear Molecular Communication Systems
Venue: arXiv cs.ET 2013
Year: 2013

Recently, a tabletop molecular communication platform has been developed for transmitting short text messages across a room. The end-to-end system impulse response for this platform does not follow previously published theoretical works because of imperfect receiver, transmitter, and turbulent flows. Moreover, it is observed that this platform resembles a nonlinear system, which makes the rich body of theoretical work that has been developed by communication engineers not applicable to this platform. In this work, we first introduce corrections to the previous theoretical models of the end-to-end system impulse response based on the observed data from experimentation. Using the corrected impulse response models, we then formulate the nonlinearity of the system as noise and show that through simplifying assumptions it can be represented as Gaussian noise. Through formulating the system's nonlinearity as the output a linear system corrupted by noise, the rich toolbox of mathematical models of communication systems, most of which are based on linearity assumption, can be applied to this platform.
Using virtual parts to optimize the metrology process
Venue: arXiv cs.CE 2013
Year: 2013

In the measurement process, there are many parameters affecting the measurement results: the influence of the probe system, material stiffness of measured workpiece, the calibration of the probe with a reference sphere, the thermal effects. We want to obtain the limits of a measurement methodology to be able to validate a result. The study is applied to a simple part. We observe the dispersion of the position of different drilled holes (XYZ values in a coordinate system) when we change the quality of the part and the method of calculation. We use the Design of Experiment (Taguchi method) to realize our study. We study the influence of the part quality on a measurement results. We consider two parameters to define the part quality (flatness and perpendicularity). We will also study the influence of different methods of calculation to determine the coordinate system. We can use two options in Metrolog XG software (tangent plane with or without orientation constraint). The originality of this paper is that we present a method for the design of experiment that uses CATIA (CAD system) to generate the measured parts. In this way we can realize a design of experiment with a largest number of experimental results. This is a positive point for a statistical analysis. We are also free to define the parts we want to study without manufacturing difficulties.
Linking Software Development and Business Strategy Through Measurement
Venue: arXiv cs.SE 2013
Year: 2013

Most of today's products and services are software-based. Organizations that develop software want to maintain and improve their competitiveness by controlling software-related risks. To do this, they need to align their business goals with software development strategies and translate them into quantitative project management. There is also an increasing need to justify cost and resources for software and system development and other IT services by demonstrating their impact on an organisation's higher-level goals. For both, linking business goals and software-related efforts in an organization is necessary. However, this is a challenging task, and there is a lack of methods addressing this gap. The GQM+Strategies approach effectively links goals and strategies on all levels of an organization by means of goal-oriented measurement. The approach is based on rationales for deciding about options when operationalizing goals and for evaluating the success of strategies with respect to goals.
Distributed-Pair Programming can work well and is not just Distributed Pair-Programming
Venue: arXiv cs.SE 2013
Year: 2013

Background: Distributed Pair Programming can be performed via screensharing or via a distributed IDE. The latter offers the freedom of concurrent editing (which may be helpful or damaging) and has even more awareness deficits than screen sharing. Objective: Characterize how competent distributed pair programmers may handle this additional freedom and these additional awareness deficits and characterize the impacts on the pair programming process. Method: A revelatory case study, based on direct observation of a single, highly competent distributed pair of industrial software developers during a 3-day collaboration. We use recordings of these sessions and conceptualize the phenomena seen. Results: 1. Skilled pairs may bridge the awareness deficits without visible obstruction of the overall process. 2. Skilled pairs may use the additional editing freedom in a useful limited fashion, resulting in potentially better fluency of the process than local pair programming. Conclusion: When applied skillfully in an appropriate context, distributed-pair programming can (not will!) work at least as well as local pair programming.
Inspection and Test Process Integration Based on Explicit Test Prioritization Strategies
Venue: arXiv cs.SE 2013
Year: 2013

Today's software quality assurance techniques are often applied in isolation. Consequently, synergies resulting from systematically integrating different quality assurance activities are often not exploited. Such combinations promise benefits, such as a reduction in quality assurance effort or higher defect detection rates. The integration of inspection and testing, for instance, can be used to guide testing activities. For example, testing activities can be focused on defect-prone parts based upon inspection results. Existing approaches for predicting defect-prone parts do not make systematic use of the results from inspections. This article gives an overview of an integrated inspection and testing approach, and presents a preliminary case study aiming at verifying a study design for evaluating the approach. First results from this preliminary case study indicate that synergies resulting from the integration of inspection and testing might exist, and show a trend that testing activities could be guided based on inspection results.
MARTE Profile-based MDA approach for semantic NFP-aware Web services
Venue: arXiv cs.SE 2013
Year: 2013

Non Functional Properties (NFPs) such as security, quality of service and business related properties enhance the service description and provide necessary information about the fitness of its behaviour. These properties have become crucial criteria for efficient selection and composition of Web services. However, they belong to different domains, are complex, change frequently and have to be semantically described. The W3C standard WSPolicy,recommended to describe these properties doesn t define standardized specifications that cover all NFPs domains. Moreover, it doesn t provide an easy manner to express them independently of domains, and doesn t support their semantic. This paper proposes a Model driven approach to describe and automatically generate enriched Web services including semantic NFPs. It explores both the use of the OMG Profile for Modelling and Analysis of Real-Time Embedded Systems (MARTE) and the W3C standards. Mapping rules, from NFPs profile to WS-Policy and SAWSDL files, transforms NFPs into policies associated with WSDL elements.