Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 3
Search results for: RPCA
3 Rupture Probability of Type of Coarse Aggregate on Fracture Surface of Concrete
Authors: B. Ramakrishna, S. Sivamurthy Reddy
Abstract:
The various types of aggregates such as granite, dolerite, Quartzite, dolomitic limestone, limestone and river gravel were used to produce the concrete with 28-day target compressive strength of 35, 60, and 80 Mpa. The compressive strength of concrete, as well as aggregates, was measured to study the effect of rupture probability of aggregate on the fracture surface of the concrete. Also, the petrographic studies were carried out to study the texture, type of minerals present and their relative proportions in various types of aggregates. The concrete of various grades produced with the same aggregate has shown a rise in RPCA with strength. However, the above relationship has ceased to exist in the concretes of the same grade, made of different types of aggregates. The carbonate aggregates namely Limestone and Dolomitic limestone have produced concrete with higher RPCA irrespective of the strength of concrete. The mode of origin, texture and mineralogical composition of aggregates have a significant impact on their pulse velocity and thereby the pulse velocity of concrete. Procedia PDF Downloads 2922 Emotion Recognition with Occlusions Based on Facial Expression Reconstruction and Weber Local Descriptor
Authors: Jadisha Cornejo, Helio Pedrini
Abstract:
Recognition of emotions based on facial expressions has received increasing attention from the scientific community over the last years. Several fields of applications can benefit from facial emotion recognition, such as behavior prediction, interpersonal relations, human-computer interactions, recommendation systems. In this work, we develop and analyze an emotion recognition framework based on facial expressions robust to occlusions through the Weber Local Descriptor (WLD). Initially, the occluded facial expressions are reconstructed following an extension approach of Robust Principal Component Analysis (RPCA). Then, WLD features are extracted from the facial expression representation, as well as Local Binary Patterns (LBP) and Histogram of Oriented Gradients (HOG). The feature vector space is reduced using Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA). Finally, K-Nearest Neighbor (K-NN) and Support Vector Machine (SVM) classifiers are used to recognize the expressions. Experimental results on three public datasets demonstrated that the WLD representation achieved competitive accuracy rates for occluded and non-occluded facial expressions compared to other approaches available in the literature.Keywords: emotion recognition, facial expression, occlusion, fiducial landmarks
Procedia PDF Downloads 1801 SISSLE in Consensus-Based Ripple: Some Improvements in Speed, Security, Last Mile Connectivity and Ease of Use
Authors: Mayank Mundhra, Chester Rebeiro
Abstract:
Cryptocurrencies are rapidly finding wide application in areas such as Real Time Gross Settlements and Payments Systems. Ripple is a cryptocurrency that has gained prominence with banks and payment providers. It solves the Byzantine General’s Problem with its Ripple Protocol Consensus Algorithm (RPCA), where each server maintains a list of servers, called Unique Node List (UNL) that represents the network for the server, and will not collectively defraud it. The server believes that the network has come to a consensus when members of the UNL come to a consensus on a transaction. In this paper we improve Ripple to achieve better speed, security, last mile connectivity and ease of use. We implement guidelines and automated systems for building and maintaining UNLs for resilience, robustness, improved security, and efficient information propagation. We enhance the system so as to ensure that each server receives information from across the whole network rather than just from the UNL members. We also introduce the paradigm of UNL overlap as a function of information propagation and the trust a server assigns to its own UNL. Our design not only reduces vulnerabilities such as eclipse attacks, but also makes it easier to identify malicious behaviour and entities attempting to fraudulently Double Spend or stall the system. We provide experimental evidence of the benefits of our approach over the current Ripple scheme. We observe ≥ 4.97x and 98.22x in speedup and success rate for information propagation respectively, and ≥ 3.16x and 51.70x in speedup and success rate in consensus.Keywords: Ripple, Kelips, unique node list, consensus, information propagation
Procedia PDF Downloads 145