Kooperativer Bibliotheksverbund

Berlin Brandenburg

and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • IEEE Xplore  (84)
Type of Medium
Language
Year
Source
  • 1
    Language: English
    In: IEEE Transactions on Parallel and Distributed Systems, August 2012, Vol.23(8), pp.1551-1565
    Description: The Web Services Atomic Transactions (WS-AT) specification makes it possible for businesses to engage in standard distributed transaction processing over the Internet using Web Services technology. For such business applications, trustworthy coordination of WS-AT is crucial. In this paper, we explain how to render WS-AT coordination trustworthy by applying Byzantine Fault Tolerance (BFT) techniques. More specifically, we show how to protect the core services described in the WS-AT specification, namely, the Activation service, the Registration service, the Completion service and the Coordinator service, against Byzantine faults. The main contribution of this work is that it exploits the semantics of the WS-AT services to minimize the use of Byzantine Agreement (BA), instead of applying BFT techniques naively, which would be prohibitively expensive. We have incorporated our BFT protocols and mechanisms into an open-source framework that implements the WS-AT specification. The resulting BFT framework for WS-AT is useful for business applications that are based on WS-AT and that require a high degree of dependability, security, and trust.
    Keywords: Protocols ; Security ; Fault Tolerance ; Fault Tolerant Systems ; Simple Object Access Protocol ; Atomic Transactions ; Distributed Transactions ; Service-Oriented Computing ; Web Services ; Dependability ; Security ; Trust ; Encryption ; Authentication ; Byzantine Fault Tolerance ; Engineering ; Computer Science
    ISSN: 1045-9219
    E-ISSN: 1558-2183
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Conference Proceeding
    Conference Proceeding
    Language: English
    In: 2018 12th International Symposium on Antennas, Propagation and EM Theory (ISAPE), December 2018, pp.1-3
    Description: For pulse-excited UWB antennas, because the antenna can only radiate part of the frequency energy, but the pulse signal bandwidth is very wide, a circuit for recovering energy of UWB antenna in time domain is designed in this paper. This energy recovery circuit can collect the energy wasted by the original antenna through heating, which is not radiated out, to recharge the battery, so as to achieve energy recycling and improve battery standby time.
    Keywords: Low Pass Filters ; Ultra Wideband Antennas ; Recycling ; Impedance ; Microstrip Filters ; Insertion Loss ; Microwave Filters ; Pulse Excitation ; Time Domain Uwb ; Energy Recovery
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Language: English
    In: 2018 25th IEEE International Conference on Image Processing (ICIP), October 2018, pp.1083-1087
    Description: Principal component analysis (PCA) and linear discriminant analysis (LDA) are the most well-known methods to reduce the dimensionality of feature vectors. However, both methods face challenges when used on multilabel data-each data point may be associated to multiple labels. PCA does not take advantage of label information thus the performance is sacrificed. LDA can exploit class information for multiclass data, but cannot be directly applied to multilabel problems. In this paper, we propose a novel dimensionality reduction method for multilabel data. We first introduce the generalized Hamming distance that measures the distance of two data points in the label space. Then the proposed distance is used in the graph embedding framework for feature dimension reduction. We verified the proposed method using three multilabel benchmark datasets and one large image dataset. The results show that the proposed feature dimensionality reduction method consistently outperforms PCA and other competing methods.
    Keywords: Dimensionality Reduction ; Principal Component Analysis ; Hamming Distance ; Mutual Information ; Measurement ; Dogs ; Linear Programming ; Dimensionality Reduction ; Graph Embedding ; Multilabel ; Applied Sciences
    ISSN: 15224880
    E-ISSN: 2381-8549
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Language: English
    In: IEEE Transactions on Services Computing, April 2013, Vol.6(2), pp.276-288
    Description: We present a lightweight Byzantine fault tolerance (BFT) algorithm, which can be used to render the coordination of web services business activities (WS-BA) more trustworthy. The lightweight design of the BFT algorithm is the result of a comprehensive study of the threats to the WS-BA coordination services and a careful analysis of the state model of WS-BA. The lightweight BFT algorithm uses source ordering, rather than total ordering, of incoming requests to achieve Byzantine fault tolerant, state-machine replication of the WS-BA coordination services. We have implemented the lightweight BFT algorithm, and incorporated it into the open-source Kandula framework, which implements the WS-BA specification with the WS-BA-I extension. Performance evaluation results obtained from the prototype implementation confirm the efficiency and effectiveness of our lightweight BFT algorithm, compared to traditional BFT techniques.
    Keywords: Business ; Web Services ; Protocols ; Registers ; Context ; Algorithm Design and Analysis ; Fault Tolerance ; Business Activity ; Byzantine Fault Tolerance ; Distributed Transaction ; Service-Oriented Computing ; Trustworthy Computing ; Web Services ; Engineering ; Business
    E-ISSN: 1939-1374
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Language: English
    In: 2011 19th International Conference on Geoinformatics, June 2011, pp.1-4
    Description: The spatial differential features of tourists are the fundamental of tourism spatial structure research. Though many literatures on this issue have offered some efficient approaches, spatial view has not been paid sufficient attention to in the statistical model for spatial correlation. To explore the variation and mechanism of tourist spatial difference, exploratory spatial data analysis (ESDA) has been employed, taking the data of inbound tourist arrivals of all the cities in Jiangsu province from 2001 to 2009. Box-Cox transform has been taken to normalizing the data before ESDA. The Global and Local spatial autocorrelation analysis has been employed to examine the spatial aggregation characteristics and measure tourist distribution differences and significance between cities. Detailed discussions are then made referring to the spatial aggregation and diffusion effect. Finally, the conclusions are obtained.
    Keywords: Cities and Towns ; Correlation ; Indexes ; Aggregates ; Economics ; Transforms ; Edsa ; Spatial Difference Features ; Inbound Tourist ; Gis ; Spatial Autocorrelation Analysis ; Economics
    ISBN: 9781612848495
    ISBN: 1612848494
    ISSN: 2161024X
    E-ISSN: 21610258
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Source: IEEE eBooks
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Language: English
    In: 2014 22nd European Signal Processing Conference (EUSIPCO), September 2014, pp.785-789
    Description: Many modern computer vision systems combine high dimensional features and linear classifiers to achieve better classification accuracy. However, the excessively long features are often highly redundant; thus dramatically increases the system storage and computational load. This paper presents a novel feature selection algorithm, namely cardinal sparse partial least square algorithm, to address this deficiency in an effective way. The proposed algorithm is based on the sparse solution of partial least square regression. It aims to select a sufficiently large number of features, which can achieve good accuracy when used with linear classifiers. We applied the algorithm to a face recognition system and achieved the stateof- the-art results with significantly shorter feature vectors.
    Keywords: Face ; Face Recognition ; Computer Vision ; Databases ; Vectors ; Conferences ; Signal Processing Algorithms ; Feature Selection ; Sparse Partial Least Square ; Face Recognition ; Engineering
    ISSN: 2219-5491
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Source: IEEE eBooks
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Language: English
    In: 2015 2nd International Conference on Information Science and Control Engineering, April 2015, pp.901-905
    Description: The radio covering area in band shape could be produced by dual antennas system for directional transmitting (DASDT), which transmits radio signals in the same phase by two antennas. DASDT is a kind of transmitter that is compatible with the radio covering channel in band shape, and it could be applied in the environment of common radio covering channel in band shape, such as corridors, highways and railway. Under the conditions of the two signals fed to the dual antennas being in phase and the distance between those two antennas is λ/2, where λ is the wave length of the radio frequency, the mathematical equations for directional beam-forming could be deduced, and then the physical mode could also be derived. Many simulation results of beam patterns are given in this paper, and they could be used to confirm the effectiveness of the DASDT system for the directional beam-forming.
    Keywords: Directive Antennas ; Multiaccess Communication ; Transmitting Antennas ; Arrays ; Receivers ; Dual Antenna ; Directional Beam-Forming ; Radio Covering Channel in Band Shape
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Language: English
    In: 2018 41st International Conference on Telecommunications and Signal Processing (TSP), July 2018, pp.1-7
    Description: Data clustering is a fundamental machine learning problem. Community structure is common in social and biological networks. In this article we propose a novel data clustering algorithm that uses this phenomenon in mutual k - nearest neighbor (MKNN) graph constructed from the input dataset. We use the authentic scores-a metric that measures the strength of an edge in a social network graph-to rank all the edges in the MKNN graph. By removing the edges gradually in the order of their authentic scores, we collapse the MKNN graph into components to find the clusters. The proposed method has two major advantages comparing to other popular data clustering algorithms. First, it is robust to the noise in the data. Second, it finds clusters of arbitrary shape. We evaluated our algorithm on synthetic noisy datasets, synthetic 2D datasets and real-world image datasets. Results on the noisy datasets show that the proposed algorithm clearly outperforms the competing algorithms in terms of Normalized Mutual Information (NMI) scores. The proposed algorithm is the only one that does not fail on any data in the the synthetic 2D dataset, which are specifically designed to show the limitations of the clustering algorithms. When testing on the real-world image datasets, the best NMI scores achieved by the proposed algorithm is more than any other competing algorithm. The proposed algorithm has computational complexity of O(k^3n+kn\log (kn)) and space complexity of O(kn), which is better than or equivalent to the most popular clustering algorithms.
    Keywords: Clustering Algorithms ; Signal Processing Algorithms ; Machine Learning Algorithms ; Partitioning Algorithms ; Image Edge Detection ; Clustering Methods ; Social Network Services ; Data Clustering ; Authentic Score ; Graph
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Language: English
    In: 2012 International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering, June 2012, pp.349-352
    Description: Assignments of the vessels change suddenly sometimes, so the marine steam vessels need better thermoeconomic. Based on the thermodynamic calculation theory, thermodynamic calculation models of equipments in marine steam power plants are developed. Then, the thermoeconomic calculation model of marine steam power plants is established with index of fuel consumption of one nautical mile. Also utility software is developed for thermoeconomic calculation of marine steam power plants. The result indicates that the thermoeconomic calculation model is practical and efficient. These result can be used as references for the settlement of thermoeconomic analysis of other types of power plants.
    Keywords: Boilers ; Turbines ; Thermodynamics ; Fuels ; Production ; Indexes ; Marine Steam Power Plants ; Thermoeconomic ; Utility Software ; Fuel Consumption ; Monte Carlo
    ISBN: 9781467307864
    ISBN: 1467307866
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Source: IEEE eBooks
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Language: English
    In: 2011 Second International Conference on Mechanic Automation and Control Engineering, July 2011, pp.25-28
    Description: Assignments of the vessels change suddenly sometimes, so the vessels need several of operation plans on the marine steam power plant. Based on the thermodynamic calculation theory, maneuverability analysis model of steam-powered vessel is given with the maximum speed index for different operation plans of steam power plant. The result indicates that the maneuverability model is practical and efficient. And there is significance of using for reference for the settlement of maneuverability analysis of other types of power plants.
    Keywords: Turbines ; Boilers ; Mathematical Model ; Thermodynamics ; Equations ; Solid Modeling ; Marine Steam Power Vessel ; Maneuverability ; Thermodynamic Calculation ; Maximum Speed
    ISBN: 9781424494361
    ISBN: 1424494362
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Source: IEEE eBooks
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages