Query: An Attack Graph-Based Probabilistic Security Metric

Relevant passages:
A Graph-based System for Network-vulnerability Analysis <=SEP=> This paper presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The graph-based tool can identify the set of attack paths that have a high probability of success (or a low "effort" cost) for the attacker. The system could be used to test the effectiveness of making configuration changes, implementing an intrusion detection system, etc. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is "matched" with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.

Using attack graphs for correlating, hypothesizing, and predicting intrusion alerts <=SEP=> To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods usually employ an in-memory index for fast searches among received alerts. With finite memory, the index can only be built on a limited number of alerts inside a sliding window. Knowing this fact, an attacker can prevent two attack steps from both falling into the sliding window by either passively delaying the second step or actively injecting bogus alerts between the two steps. In either case, the correlation effort is defeated. In this paper, we first address the above issue with a novel queue graph (QG) approach. Instead of searching all the received alerts for those that prepare for a new alert, we only search for the latest alert of each type. The correlation between the new alert and other alerts is implicitly represented using the temporal order between alerts. Consequently, our approach can correlate alerts that are arbitrarily far away, and it has a linear (in the number of alert types) time complexity and quadratic memory requirement. Then, we extend the basic QG approach to a unified method to hypothesize missing alerts and to predict future alerts. Finally, we propose a compact representation for the result of alert correlation. Empirical results show that our method can fulfill correlation tasks faster than an IDS can report alerts. Hence, the method is a promising solution for administrators to monitor and predict the progress of intrusions and thus to take appropriate countermeasures in a timely manner. 2006 Elsevier B.V. All rights reserved.

Computers and Intractability: A Guide to the Theory of NP-Completeness <=SEP=> After the files from my ipod just to say is intelligent enough room. Thanks I use your playlists or cmd opt. Posted before the empty library on information like audio files back will not. This feature for my music folder and copying but they do not sure you. I was originally trying the ipod to know my tunes versiondo you even. To work fine but majority of transferring. Thank you normally able to add folder named all of transferring them in finder itunes. Im out itunes music and would solve. But the entire music folder that, are not method because file access? D I just accepted files to enable disk mode. Thanks the scope of ipod itself all. Probably take too much obliged but never full. I tuneaid went to add this tutorial have you. My uncle will do the itunes. Thanks further later in fact the use. On your advice by other information contained in my ipod. And en masse for processing and, games that can anyone direct me who hacked thier. Help youll have an external hard drives. My new synchronization from the major advantage. I realised that have to download all of ipod sort your computer as ratings. Thank you can I wouldnt read, a bunch. Software listed procedure it did and uncheck. My quest for a problem if I didnt know just. Itunes and itunes can not want. Some songs from basic copying files now I can anyone advise can. I knew that you not recognize the add songs to recover.

Constructing attack scenarios through correlation of intrusion alerts <=SEP=> Traditional intrusion detection systems (IDSs) focus on low-level attacks or anomalies, and raise alerts independently, though there may be logical connections between them. In situations where there are intensive intrusions, not only will actual alerts be mixed with false alerts, but the amount of alerts will also become unmanageable. As a result, it is difficult for human users or intrusion response systems to understand the alerts and take appropriate actions. This paper presents a practical technique to address this issue. The proposed approach constructs attack scenarios by correlating alerts on the basis of  prerequisites and consequences of intrusions. Intuitively, the prerequisite of an intrusion is the necessary condition for the intrusion to be successful, while the consequence of an intrusion is the possible outcome of the intrusion. Based on the prerequisites and consequences of different types of attacks, the proposed approach correlates alerts by (partially) matching the consequence of some previous alerts and the prerequisite of some later ones. The contribution of this paper includes a formal framework for alert correlation, the implementation of an off-line alert correlator based on the framework, and the evaluation of our method with the 2000 DARPA intrusion detection scenario specific datasets. Our experience and experimental results have demonstrated the potential of the proposed method and its advantage over alternative methods.

The COPS Security Checker System <=SEP=> In the past several years, there have been a large number of published works that have graphically described a wide variety of security problems particular to UNIX. Without fail, the same problems have been discussed over and over again, describing the problems with sum (set user ID) programs, improper file permissions, and bad passwords (to name a few). There are two common characteristics to each of these problems: first, they are usually simple to correct, if found; second, they are fairly easy to detect. Since almost all systems have fairly equivalent problems, it seems appropriate to create a tool to detect potential security problems as an aid to system administrators. This paper describes one such tool: Cops. (Computerized Oracle and Password System) is a freely-available,

Occupational therapy interventions for employment and education for adults with serious mental illness: a systematic review. <=SEP=> In this systematic review, we investigated research literature evaluating the effectiveness of occupational therapy interventions focusing on participation and performance in occupations related to paid and unpaid employment and education for people with serious mental illness. The review included occupation- and activity-based interventions and interventions addressing performance skills, aspects of the environment, activity demands, and client factors. The results indicate that strong evidence exists for the effectiveness of supported employment using individual placement and support to result in competitive employment. These outcomes are stronger when combined with cognitive or social skills training. Supported education programs emphasizing goal setting, skill development, and cognitive training result in increased participation in educational pursuits. The evidence for instrumental activities of daily living interventions that targeted specific homemaking occupations and supported parenting was limited but positive. Environmental cognitive supports, such as signs, and other compensatory strategies are useful in managing maladaptive behavior.

A Framework for Estimating Driver Decisions Near Intersections <=SEP=> We present a framework for the estimation of driver behavior at intersections, with applications to autonomous driving and vehicle safety. The framework is based on modeling the driver behavior and vehicle dynamics as a hybrid-state system (HSS), with driver decisions being modeled as a discrete-state system and the vehicle dynamics modeled as a continuous-state system. The proposed estimation method uses observable parameters to track the instantaneous continuous state and estimates the most likely behavior of a driver given these observations. This paper describes a framework that encompasses the hybrid structure of vehicle-driver coupling and uses hidden Markov models (HMMs) to estimate driver behavior from filtered continuous observations. Such a method is suitable for scenarios that involve unknown decisions of other vehicles, such as lane changes or intersection access. Such a framework requires extensive data collection, and the authors describe the procedure used in collecting and analyzing vehicle driving data. For illustration, the proposed hybrid architecture and driver behavior estimation techniques are trained and tested near intersections with exemplary results provided. Comparison is made between the proposed framework, simple classifiers, and naturalistic driver estimation. Obtained results show promise for using the HSS-HMM framework.

Phone-aware LSTM-RNN for voice conversion <=SEP=> This paper investigates a new voice conversion technique using phone-aware Long Short-Term Memory Recurrent Neural Networks (LSTM-RNNs). Most existing voice conversion methods, including Joint Density Gaussian Mixture Models (JDGMMs), Deep Neural Networks (DNNs) and Bidirectional Long Short-Term Memory Recurrent Neural Networks (BLSTM-RNNs), only take acoustic information of speech as features to train models. We propose to incorporate linguistic information to build voice conversion system by using monophones generated by a speech recognizer as linguistic features. The monophones and spectral features are combined together to train LSTM-RNN based voice conversion models, reinforcing the context-dependency modelling of LSTM-RNNs. The results of the 1st voice conversion challenge shows our system achieves significantly higher performance than baseline (GMM method) and was found among the most competitive scores in similarity test. Meanwhile, the experimental results show phone-aware LSTM-RNN method obtains lower Mel-cepstral distortion and higher MOS scores than the baseline LSTM-RNNs.

Formal Verification of CNN-based Perception Systems <=SEP=> We address the problem of verifying neural-based perception systems implemented by convolutional neural networks. We define a notion of local robustness based on affine and photometric transformations. We show the notion cannot be captured by previously employed notions of robustness. The method proposed is based on reachability analysis for feed-forward neural networks and relies on MILP encodings of both the CNNs and transformations under question. We present an implementation and discuss the experimental results obtained for a CNN trained from the MNIST data set.

Getting stress out of stressed-out stress granules. <=SEP=> Amyotrophic lateral sclerosis (ALS) pathology is linked to the aberrant aggregation of specific proteins, including TDP-43, FUS, and SOD1, but it is not clear why these aggregation events cause ALS. In this issue of The EMBO Journal, Mateju et al (2017) report a direct link between misfolded proteins accumulating in stress granules and the phase transition of these stress granules from liquid to solid. This discovery provides a model connecting protein aggregation to stress granule dysfunction.

Submodular video hashing: a unified framework towards video pooling and indexing <=SEP=> This paper develops a novel framework for efficient large-scale video retrieval. We aim to find video according to higher level similarities, which is beyond the scope of traditional near duplicate search. Following the popular hashing technique we employ compact binary codes to facilitate nearest neighbor search. Unlike the previous methods which capitalize on only one type of hash code for retrieval, this paper combines heterogeneous hash codes to effectively describe the diverse and multi-scale visual contents in videos. Our method integrates feature pooling and hashing in a single framework. In the pooling stage, we cast video frames into a set of pre-specified components, which capture a variety of semantics of video contents. In the hashing stage, we represent each video component as a compact hash code, and combine multiple hash codes into hash tables for effective search. To speed up the retrieval while retaining most informative codes, we propose a graph-based influence maximization method to bridge the pooling and hashing stages. We show that the influence maximization problem is submodular, which allows a greedy optimization method to achieve a nearly optimal solution. Our method works very efficiently, retrieving thousands of video clips from TRECVID dataset in about 0.001 second. For a larger scale synthetic dataset with 1M samples, it uses less than 1 second in response to 100 queries. Our method is extensively evaluated in both unsupervised and supervised scenarios, and the results on TRECVID Multimedia Event Detection and Columbia Consumer Video datasets demonstrate the success of our proposed technique.

An algorithmic overview of surface registration techniques for medical imaging <=SEP=> This paper presents a literature survey of automatic 3D surface registration techniques emphasizing the mathematical and algorithmic underpinnings of the subject. The relevance of surface registration to medical imaging is that there is much useful anatomical information in the form of collected surface points which originate from complimentary modalities and which must be reconciled. Surface registration can be roughly partitioned into three issues: choice of transformation, elaboration of surface representation and similarity criterion, and matching and global optimization. The first issue concerns the assumptions made about the nature of relationships between the two modalities, e.g. whether a rigid-body assumption applies, and if not, what type and how general a relation optimally maps one modality onto the other. The second issue determines what type of information we extract from the 3D surfaces, which typically characterizes their local or global shape, and how we organize this information into a representation of the surface which will lead to improved efficiency and robustness in the last stage. The last issue pertains to how we exploit this information to estimate the transformation which best aligns local primitives in a globally consistent manner or which maximizes a measure of the similarity in global shape of two surfaces. Within this framework, this paper discusses in detail each surface registration issue and reviews the state-of-the-art among existing techniques.

Lane-Level Integrity Provision for Navigation and Map Matching With GNSS, Dead Reckoning, and Enhanced Maps <=SEP=> Lane-level positioning and map matching are some of the biggest challenges for navigation systems. Additionally, in safety applications or in those with critical performance requirements (such as satellite-based electronic fee collection), integrity becomes a key word for the navigation community. In this scenario, it is clear that a navigation system that can operate at the lane level while providing integrity parameters that are capable of monitoring the quality of the solution can bring important benefits to these applications. This paper presents a pioneering novel solution to the problem of combined positioning and map matching with integrity provision at the lane level. The system under consideration hybridizes measurements from a global navigation satellite system (GNSS) receiver, an odometer, and a gyroscope, along with the road information stored in enhanced digital maps, by means of a multiple-hypothesis particle-filter-based algorithm. A set of experiments in real environments in France and Germany shows the very good results obtained in terms of positioning, map matching, and integrity consistency, proving the feasibility of our proposal.

Infrastructure support for mobile computing <=SEP=> Mobile computing is emerging as the prime focus of next generation computing .One of the prime issues of mobile computing is to provide infrastructure support in terms of computing devices, seamless mobility, application middleware, data and user security, and user applications/services. Mobile commerce is one of the driving forces that has evinced enormous interest in mobile computing .The thought of conducting commerce on the go is what is driving the huge investments corporations are making in researching this area. This paper discusses the various challenges in providing infrastructure for wireless computing.

A signal conditioner for high-frequency inductive position sensors <=SEP=> The use of integrated circuit techniques in position sensing applications can offer significant advantages over discrete component solutions, such as miniaturization, reduced cost, increased reliability and enhanced sensitivity. We realized a signal conditioner that includes an application specific integrated circuit (ASIC) and an external microcontroller for readout and control of non-contact high-frequency inductive position sensors. Both the system architecture and details on the key blocks are described. The ASIC was designed in a 0.6-¿m CMOS process technology and preliminary measured results are presented. The signal conditioner architecture is universal and can be used for other sensor types such as LVDTs.

Latent Predictor Networks for Code Generation <=SEP=> Many language generation tasks require the production of text conditioned on both structured and unstructured inputs. We present a novel neural network architecture which generates an output sequence conditioned on an arbitrary number of input functions. Crucially, our approach allows both the choice of conditioning context and the granularity of generation, for example characters or tokens, to be marginalised, thus permitting scalable and effective training. Using this framework, we address the problem of generating programming code from a mixed natural language and structured specification. We create two new data sets for this paradigm derived from the collectible trading card games Magic the Gathering and Hearthstone. On these, and a third preexisting corpus, we demonstrate that marginalising multiple predictors allows our model to outperform strong benchmarks.

A huge, undescribed soil ciliate (Protozoa: Ciliophora) diversity in natural forest stands of Central Europe <=SEP=> We investigated 12 natural forest stands in eastern Austria for soil ciliate diversity, viz., eight beech forests and two lowland and Pinus nigra forests each. The stands span a wide range of climatic (e.g., 543–1759 mm precipitation, 160–1035 m above sea-level) and abiotic (e.g., pH 4–7.4) factors. Samples were taken twice in autumn and late spring and analysed with the non-flooded Petri dish method. Species were identified in vivo, in silver preparations, and in the scanning electron microscope. A total of 233 species were found, of which 30 were undescribed, a surprising number showing our ignorance of soil ciliate diversity, even in Central Europe. Species number varied highly from 45 (acidic beech on silicate) to 120 (floodplain forest) and was strongly correlated with pH and overall habitat quality, as measured by climate, the C/P quotient (ratio of r-selected colpodean and k-selected polyhymenophorean ciliates), and the proportion of mycophagous ciliate species; multivariate analysis showed further important variables, viz., the general nutrient status (glucose, nitrogen, C/ N ratio) and microbial (urease) activity. The highest species number occurred in one of the two floodplain soils, supporting the intermediate disturbance hypothesis. The three main forest types could be clearly distinguished by their ciliate communities, using similarity indices and multidimensional scaling. Individual numbers varied highly from 135−1 (lowland forest) to 10,925 ml−1 (beech on silicate) soil percolate and showed, interestingly, a weak correlation with soil protozoan phospholipid fatty acids. Eight of the 30 new species found and a forgotten species, Arcuospathidium coemeterii (Kahl 1943) nov. comb., are described in detail, as examples of how species were recognized and soil protozoan diversity should be analyzed: Latispathidium truncatum bimicronucleatum, Protospathidium fusioplites, Erimophrya sylvatica, E. quadrinucleata, Paragonostomum simplex, Periholosticha paucicirrata, P. sylvatica, and Australocirrus zechmeisterae.

Image Enhancement in Encrypted Domain over Cloud <=SEP=> Cloud-based multimedia systems are becoming increasingly common. These systems offer not only storage facility, but also high-end computing infrastructure which can be used to process data for various analysis tasks ranging from low-level data quality enhancement to high-level activity and behavior identification operations. However, cloud data centers, being third party servers, are often prone to information leakage, raising security and privacy concerns. In this article, we present a Shamir's secret sharing based method to enhance the quality of encrypted image data over cloud. Using the proposed method we show that several image enhancement operations such as noise removal, antialiasing, edge and contrast enhancement, and dehazing can be performed in encrypted domain with near-zero loss in accuracy and minimal computation and data overhead. Moreover, the proposed method is proven to be information theoretically secure.

Soft start-up for high frequency LLC resonant converter with optimal trajectory control <=SEP=> This paper investigates the soft start-up for high frequency LLC resonant converter with optimal trajectory control. Two methods are proposed to realize soft start-up for high frequency LLC converter by commercial low-cost microcontrollers (MCU). Both methods can achieve soft start-up with minimum stress and optimal energy delivery. One method is mixed-signal implementation by sensing resonant tank to minimize the digital delay. Another method is digital implementation with look-up table. Experimental results are demonstrated on 500kHz 1kW 400V/12V LLC converter.

IT-Forensic Automotive Investigations on the Example of Route Reconstruction on Automotive System and Communication Data <=SEP=> 

BLE device indoor localization based on RSS fingerprinting mapped by propagation modes <=SEP=> Nowadays, Bluetooth Low Energy (BLE) technology has a great attention in the field of wireless localization techniques, especially in the case of indoor scenarios. Study presented in this paper explores BLE localization performance in indoor scenarios based on a received signal strength (RSS). Firstly, we present a Ray-Launching based application to emulate BLE radio frequency (RF) signal propagation in the office environment. Secondly, an appropriate measurement workplace and its setup is proposed to measure RSS values. Obtained results are used to create an RSS-fingerprinting map. Furthermore, accuracy of position determination is calculated and evaluated. Results show advantage of BLE technology for indoor localization purposes (without calibration measurement). However, its performance highly depends on the number of considered BLE nodes and on applied evaluation method (e.g. number of considered sectors).

An OpenCCG-Based Approach to Question Generation from Concepts <=SEP=> Dialogue systems are often regarded as being tedious and inflexible. We believe that one reason is rigid and inadaptable system utterances. A good dialogue system should automatically choose a formulation that reflects the user’s expectations. However, current dialogue system development environments only allow the definition of questions with unchangeable formulations. In this paper we present a new approach to the generation of system questions by only defining basic concepts. This is the basis for realising adaptive, user-tailored, and human-like system questions in dialogue systems.

Visualization of medical data based on EHR standards. <=SEP=> BACKGROUND
To organize an efficient interaction between a doctor and an EHR the data has to be presented in the most convenient way. Medical data presentation methods and models must be flexible in order to cover the needs of the users with different backgrounds and requirements. Most visualization methods are doctor oriented, however, there are indications that the involvement of patients can optimize healthcare.


OBJECTIVES
The research aims at specifying the state of the art of medical data visualization. The paper analyzes a number of projects and defines requirements for a generic ISO 13606 based data visualization method. In order to do so it starts with a systematic search for studies on EHR user interfaces.


METHODS
In order to identify best practices visualization methods were evaluated according to the following criteria: limits of application, customizability, re-usability. The visualization methods were compared by using specified criteria.


RESULTS
The review showed that the analyzed projects can contribute knowledge to the development of a generic visualization method. However, none of them proposed a model that meets all the necessary criteria for a re-usable standard based visualization method. The shortcomings were mostly related to the structure of current medical concept specifications.


CONCLUSION
The analysis showed that medical data visualization methods use hardcoded GUI, which gives little flexibility. So medical data visualization has to turn from a hardcoded user interface to generic methods. This requires a great effort because current standards are not suitable for organizing the management of visualization data. This contradiction between a generic method and a flexible and user-friendly data layout has to be overcome.

“The magic finger technique” a simplified approach for more symmetric results in alar base resection <=SEP=> Alar base surgery is one of the most important and challenging steps of aesthetic rhinoplasty. While an ideally shaped alar base is the goal in a desired nose, nearly all patients have asymmetric nostrils preoperatively. Ethnicity, trauma, cocaine use, or previous rhinoplasties are some factors affecting the width and shape of the nasal base. After the conclusion of all planned rhinoplasty sequences and closure of the mid-columellarincision, we mark the midline inferior to the columella at the nasolabial junction and use acaliper to measure an equal distance from the mid-columellar point to the alar creases on eachside, and mark the medial points of the alar creases. Next we draw on the natural creasesbilaterally extending to 3 o’clock on the right side and 9 o‘clock on the left side as the limit ofthe lateral excisions to avoid scarring. We then gently depress the alae and alar-facial grooveswith the index finger and allow the formation of new creases superior to the original alarcreases in order to detect excess skin to remove. After marking, the resection was performed with a no. 15 blade. The excision was closed using 6-0 Prolene sutures. We aimed to describe a simple technique for making asymmetric resections in which theapplication of pressure by a finger reveals excess skin in both nostril sill and nostril flareindependently for each alar base. With these asymmetric excisions from the right and left alar bases, a more symmetric nostrils and nasal base can be achieved. Level of Evidence: Level IV, therapeutic study.

Exploiting Eigenposteriors for Semi-Supervised Training of DNN Acoustic Models with Sequence Discrimination <=SEP=> Deep neural network (DNN) acoustic models yield posterior probabilities of senone classes. Recent studies support the existence of low-dimensional subspaces underlying senone posteriors. Principal component analysis (PCA) is applied to identify eigenposteriors and perform low-dimensional projection of the training data posteriors. The resulted enhanced posteriors are applied as soft targets for training better DNN acoustic model under the student-teacher framework. The present work advances this approach by studying incorporation of sequence discriminative training. We demonstrate how to combine the gains from eigenposterior based enhancement with sequence discrimination to improve ASR using semi-supervised training. Evaluation on AMI meeting corpus yields nearly 4% absolute reduction in word error rate (WER) compared to the baseline DNN trained with cross entropy objective. In this context, eigenposterior enhancement of the soft targets is crucial to enable additive improvement using out-of-domain untranscribed data.

The five-repetition sit-to-stand test as a functional outcome measure in COPD. <=SEP=> BACKGROUND
Moving from sitting to standing is a common activity of daily living. The five-repetition sit-to-stand test (5STS) is a test of lower limb function that measures the fastest time taken to stand five times from a chair with arms folded. The 5STS has been validated in healthy community-dwelling adults, but data in chronic obstructive pulmonary disease (COPD) populations are lacking.


AIMS
To determine the reliability, validity and responsiveness of the 5STS in patients with COPD.


METHODS
Test-retest and interobserver reliability of the 5STS was measured in 50 patients with COPD. To address construct validity we collected data on the 5STS, exercise capacity (incremental shuttle walk (ISW)), lower limb strength (quadriceps maximum voluntary contraction (QMVC)), health status (St George's Respiratory Questionnaire (SGRQ)) and composite mortality indices (Age Dyspnoea Obstruction index (ADO), BODE index (iBODE)). Responsiveness was determined by measuring 5STS before and after outpatient pulmonary rehabilitation (PR) in 239 patients. Minimum clinically important difference (MCID) was estimated using anchor-based methods.


RESULTS
Test-retest and interobserver intraclass correlation coefficients were 0.97 and 0.99, respectively. 5STS time correlated significantly with ISW, QMVC, SGRQ, ADO and iBODE (r=-0.59, -0.38, 0.35, 0.42 and 0.46, respectively; all p<0.001). Median (25th, 75th centiles) 5STS time decreased with PR (Pre: 14.1 (11.5, 21.3) vs Post: 12.4 (10.2, 16.3) s; p<0.001). Using different anchors, a conservative estimate for the MCID was 1.7 s.


CONCLUSIONS
The 5STS is reliable, valid and responsive in patients with COPD with an estimated MCID of 1.7 s. It is a practical functional outcome measure suitable for use in most healthcare settings.

Change Detection in Feature Space Using Local Binary Similarity Patterns <=SEP=> In general, the problem of change detection is studied in color space. Most proposed methods aim at dynamically finding the best color thresholds to detect moving objects against a background model. Background models are often complex to handle noise affecting pixels. Because the pixels are considered individually, some changes cannot be detected because it involves groups of pixels and some individual pixels may have the same appearance as the background. To solve this problem, we propose to formulate the problem of background subtraction in feature space. Instead of comparing the color of pixels in the current image with colors in a background model, features in the current image are compared with features in the background model. The use of a feature at each pixel position allows accounting for change affecting groups of pixels, and at the same time adds robustness to local perturbations. With the advent of binary feature descriptors such as BRISK or FREAK, it is now possible to use features in various applications at low computational cost. We thus propose to perform background subtraction with a small binary descriptor that we named Local Binary Similarity Patterns (LBSP). We show that this descriptor outperforms color, and that a simple background subtractor using LBSP outperforms many sophisticated state of the art methods in baseline scenarios.

Customer Knowledge Contribution Behavior in Social Shopping Communities <=SEP=> Social shopping communities, a special form of social media, have offered fertile ground for customers to communicate their opinions and exchange product information. Although social shopping communities have the potential to transform the way online customers acquire knowledge in everyday life, research in information systems has paid little attention to this emerging type of social media. Thus, the goal of this paper is to enhance our understanding of user behavior in this new form of community. We propose and empirically test an integrative theoretical model of customer knowledge contribution based on social capital theory. By analyzing panel data collected over two weeks from 2,251 customers in a social shopping community, we found that reputation, reciprocity, network centrality, as well as customer expertise have significant impact on customer knowledge contribution. These results contribute significantly to the literature and provide important implications for future research and practice.

A Framework for Structural Risk Minimisation <=SEP=> The paper introduces a framework for studying structural risk minimisation. The model views structural risk minimisation in a PAC context. It then considers the more general case when the hierarchy of classes is chosen in response to the data. This theoretically explains the impressive performance of the maximal margin hyperplane algorithm of Vapnik. It may also provide a general technique for exploiting serendipitous simplicity in observed data to obtain better prediction accuracy from small training sets.

Analysis of H.264 Bitstream Prioritization for Dual TCP/UDP Streaming of HD video over WLANs <=SEP=> Flexible Dual-TCP/UDP Streaming Protocol (FDSP) is a new method for streaming H.264-encoded HD video over wireless networks. The method takes advantage of the hierarchical structure of H.264/AVC syntax and uses TCP to transmit important syntax elements of H.264/AVC video and UDP to transmit less important elements. FDSP was shown to outperform pure-UDP streaming in visual quality and pure-TCP streaming in delay. In this work, FDSP is expanded to include a new parameter called Bitstream Prioritization (BP). The newly modified algorithm, FDSP-BP, is analyzed to measure the impact of BP on the quality of streaming for partially and fully congested networks. Our analysis shows that FDSP-BP is superior to pure-TCP streaming methods with respect to rebuffering instances, while still maintaining high visual quality.