varunr14/newsummary huggingface dataset:
Machine learning algorithms are a powerful group of data driven inference tools that offer an automated means of recognizing patterns in high dimensional data . Hence there is much scope for the application of MLAs to the rapidly increasing volumes of remotely sensed geophysical data for geological mapping problems . We carry out a rigorous comparison of five MLAs Naive Bayes k Nearest Neighbors Random Forests Support Vector Machines and Artificial Neural Networks in the context of a supervised lithology classification task using widely available and spatially constrained remotely sensed geophysical data . We make a further comparison of MLAs based on their sensitivity to variations in the degree of spatial clustering of training data and their response to the inclusion of explicit spatial information . Our work identifies Random Forests as a good first choice algorithm for the supervised classification of lithology using remotely sensed geophysical data . Random Forests is straightforward to train computationally efficient highly stable with respect to variations in classification model parameter values and as accurate as or substantially more accurate than the other MLAs trialed . The results of our study indicate that as training data becomes increasingly dispersed across the region under investigation MLA predictive accuracy improves dramatically . The use of explicit spatial information generates accurate lithology predictions but should be used in conjunction with geophysical data in order to generate geologically plausible predictions . MLAs such as Random Forests are valuable tools for generating reliable first pass predictions for practical geological mapping applications that combine widely available geophysical data . 


Summary: Robust comparison of five machine learning strategies. Random Forests is a good first choice for classifying lithology. Spatial distribution of training data has considerable influence on predictions. Using coordinates and geophysics data generates accurate and plausible predictions.
In the product emotional design era the website homepage design especially the aesthetic design has become a key factor that influences users first impressions attitudes and behaviors . Based on the Stimulus Organism Response theory the current study examines the mechanism through which the aesthetic design of a comprehensive job hunting website homepage affects users satisfaction . Emotion and perceived ease of use were used to describe users internal evaluation to the homepage . The Structural Equation Modeling method was used to test the proposed hypotheses . The empirical evidence shows that aesthetic formality does not have a significant impact on positive arousal but it has positively influences on energetic arousal through its impact on aesthetic appeal . The other hypotheses proposed in this study are all been supported . The additional results i.e . the effects of three key design elements on homepage aesthetics are found . The aim of this study was to provide practical recommendation in the establishment of a pattern of webpage aesthetics that influences users satisfaction . 


Summary: Effect of homepage aesthetics on users satisfaction is studied based on S O R. The effects of key design elements on homepage aesthetics are studied. The evidence is from China. Aesthetic formality has a positive impact on aesthetic appeal.
A power outage brings in economic losses for both the customers and the utilities . Studying these unwanted events and making solid predictions about the outcomes of the interruptions has been an attractive area of interest for the researchers for the last couple of decades . By making use of a customer survey study conducted in Finland this paper benefits from both the reported cost data collected from customers and from the analytical data that are available and then presents a new hybrid approach to estimate the customer interruption costs of service sector customer segment . Making use of Value Added information of the customers is a common practice for the cost normalization purposes . This paper verifies the approach by comparing the findings of the customer survey and the econometric model suggested here . This study is a unique source in terms of providing a reliable easy to apply and a straightforward model for calculating the economic impacts of power outages . 


Summary: We analyze the customer interruption costs for service sector customers. It is aimed to come up with an objective and easy to apply model. Customer survey and indirect analytical methods approaches are adopted. Customers are grouped regarding their distinct power consumption characteristics.
The boundary representations that are used to represent shape in Computer Aided Design systems create unavoidable gaps at the face boundaries of a model . Although these inconsistencies can be kept below the scale that is important for visualisation and manufacture they cause problems for many downstream tasks making it difficult to use CAD models directly for simulation or advanced geometric analysis for example . Motivated by this need for watertight models we address the problem of converting B rep models to a collection of cubic Clough Tocher splines . These splines allow a watertight join between B rep faces provide a homogeneous representation of shape and also support local adaptivity . We perform a comparative study of the most prominent Clough Tocher constructions and include some novel variants . Our criteria include visual fairness invariance to affine reparameterisations polynomial precision and approximation error . The constructions are tested on both synthetic data and CAD models that have been triangulated . Our results show that no construction is optimal in every scenario with surface quality depending heavily on the triangulation and parameterisation that are used . 


Summary: Watertight conversion of boundary representations to Clough Tocher splines. Comparative study of the most prominent Clough Tocher constructions and some novel variants. Comparison based on visual fairness invariance to affine reparameterisations polynomial precision and approximation error.
Large displays enable users to perform several tasks simultaneously . Under such circumstances notification information provided through the concept of ambient displays plays a vital role in assisting users to switch among tasks . This paper presents the experimental results of a notification system design in the peripheral region of large displays . The aim is to provide guidance for notification information design by investigating detection and discrimination performance of human observers when visual notification information is presented away from the foveal region and viewed using peripheral vision . The proposed notification system was designed using an array of glyphs . Each glyph is a small gray square with a fixed size of 60 60 pixels . By changing the gray levels of adjacent glyphs dynamically a glyph array presents a particular dynamic pattern . The experiments involved testing factors that comprised the visual angle size and shape of glyph arrays frequency of temporal modulation phase shift of each pattern and number of stimuli . The results show that glyph arrays are detected accurately if they are larger even at wide viewing angles and that the number of glyphs in a glyph array affects the performance more than the shapes of glyph arrays do . Furthermore the discrimination performance is higher when both the frequency and phase are manipulated simultaneously compared with the case when each of these dimensions is varied separately . When the number of stimuli is set at 8 for example users can maintain an accuracy rate of 70 for the multidimensional design whereas the accuracy rate is only approximately 60 for the single dimensional design . 


Summary: We propose an array of glyphs as a notification system using peripheral vision. The system behaviors were controlled by size rhythm frequency and phase shift. The size of the glyph arrays affects detectability more than location or shape. Phase shift is better than frequency as a coding dimension for discriminability. The results are worst case lower bounds for real applications.
Wireless sensor networks adopting static data gathering may suffer from unbalanced energy consumption due to non uniform packet relay . Although mobile data gathering provides a reasonable approach to solving this problem it inevitably introduces longer data collection latency due to the use of mobile data collectors . In the meanwhile energy harvesting has been considered as a promising solution to relieve energy limitation in wireless sensor networks . In this paper we consider a joint design of these two schemes and propose a novel two layer heterogeneous architecture for wireless sensor networks which consists of two types of nodes sensor nodes which are static and powered by solar panels and cluster heads that have limited mobility and can be wirelessly recharged by power transporters . Based on this network architecture we present a data gathering scheme called mobility assisted data gathering with solar irradiance awareness where sensor nodes are clustered around cluster heads that adaptively change their positions according to solar irradiance and the sensing data are forwarded to the data sink by these cluster heads working as data aggregation points . We evaluate the performance of the proposed scheme by extensive simulations and the results show that MADG SIA provides significant improvement in terms of balancing energy consumption and the amount data gathered compared to previous work . 


Summary: Consider a joint design of mobile data gathering and energy replenishment. Propose a novel two layer heterogeneous architecture for wireless sensor networks. Present a mobility assisted data gathering scheme with solar irradiance awareness. Simulation results show that MADG SIA provides significant improvement in terms of balancing energy consumption and the amount data gathered compared to previous work.
We show how to find four generic interpolants to a Hermite data set in the complex representation using Pythagorean hodograph curves generated as cuts of degree of Laurent series . The developed numerical experiments have shown that two of these interpolants are simple curves and that these have stable shape in the sense that their topologies persist when the direction of the velocity at each end point changes . Our curves are fair but have different shapes to those of other interpolants . Unlike existing methods our technique allows regular PH interpolants to be found for special collinear Hermite data sets . 


Summary: We introduce a new class of PH curves PH cuts of degree of Laurent series. We show how to find PH skew cut interpolants to a Hermite data set. We show that two of these interpolants are short simple curves with stable shape. Our curves are fair with different shapes to those of other interpolants. We can obtain regular PH interpolants for collinear Hermite data sets.
Broadcast scheduling for low duty cycle wireless sensor networks has been extensively studied recently . However existing solutions mainly focused on optimizing delay and total energy consumption without considering load distribution among nodes . Due to limited energy supply for sensor nodes heavily loaded sensors often run out of energy quickly reducing the lifetime of the whole network . In this paper we target at minimizing the maximum transmission load of a broadcast schedule for low duty cycle WSNs subject to the constraint that each node should have the minimum end to end delay under the broadcast schedule . We prove that it is NP hard to find the optimal schedule . Then we devise a Load Balanced Parents Assignment Algorithm that achieves approximation ratio where denotes the maximum number of neighbors that are scheduled to wake up at the same time and is typically a small number in low duty cycle WSNs . Further we introduce how to solve this problem in a distributed manner . Our simulation results reveal that compared with the traditional solutions our proposed LBPA A and distributed solution both exhibit much better average performance in terms of energy fairness total energy consumption and delivery ratio . 


Summary: We are the first to investigate the load balanced minimum end to end delay broadcast scheduling problem LB MEBS for low duty cycle WSNs. We prove that LB MEBS problem is NP hard. We propose an approximation algorithm to address LB MEBS problem. We also propose an efficient distributed solution to address LB MEBS problem. Extensive simulation are conducted to validate the effectiveness of our proposed solutions.
We present an algorithm developed for GIS applications in order to produce maps of landside susceptibility in postglacial and glacial sediments in Sweden . The algorithm operates on detailed topographic and Quaternary deposit data . We compare our algorithm to two similar computational schemes based on a global visibility operator and a shadow casting algorithm . We find that our algorithm produces more reliable results in the vicinity of stable material than the global visibility algorithm . We also conclude that our algorithm is more computationally efficient than the other two methods which is important when we may want to assess the effects of uncertainty in the data by evaluating many different models . Our method also provides the possibility to take other data into account . We show how different soil types with different geotechnical properties may be modelled . Our algorithm may also take depth information i.e . the thicknesses of the deposits into account . We thus propose that our method may be used to provide more refined maps than the overview maps in areas where more detailed geotechnical geological data have been acquired . The efficiency of our algorithm suggests that it may replace any global visibility operators used in other applications or processing schemes of gridded map data . 


Summary: We describe a novel method to identify slope and soil criteria of landslides in sensitive clays which is computationally fast and efficient. Provides more reliable results close to stable areas. The model can deposit with laterally varying geotechnical properties. Takes the thickness of the deposits into account.
The stock market is a popular topic in Twitter . The number of tweets concerning a stock varies over days and sometimes exhibits a significant spike . In this paper we investigate the relationship between Twitter volume spikes and stock options pricing . We start with the underlying assumption of the Black Scholes model the most widely used model for stock options pricing and investigate when this assumption holds for stocks that have Twitter volume spikes . We find that the assumption is less likely to hold in the time period before a Twitter volume spike and is more likely to hold afterwards . In addition the volatility of a stock is significantly lower after a Twitter volume spike than that before the spike . We also find that implied volatility increases sharply before a Twitter volume spike and decreases quickly afterwards . In addition put options tend to be priced higher than call options . Last we find that right after a Twitter volume spike options may still be overpriced . Based on the above findings we propose a put spread selling strategy for stock options trading . Realistic simulation of a portfolio using one year stock market data demonstrates that even in a conservative setting this strategy achieves a 34.3 gain when taking account of commissions and ask bid spread while S P 500 only increases 12.8 in the same period . 


Summary: We show how Twitter volume spikes relate to stock options pricing. After a Twitter volume spike the volatility of a stock drops significantly. Implied volatility rises sharply before Twitter volume spikes and drops fast later. Right after a Twitter volume spike options may still be overpriced especial puts. We propose successful stock options trading strategies based on the findings above.
Test case prioritization assigns the execution priorities of the test cases in a given test suite . Many existing test case prioritization techniques assume the full fledged availability of code coverage data fault history or test specification which are seldom well maintained in real world software development projects . This paper proposes a novel family of input based local beam search adaptive randomized techniques . They make adaptive tree based randomized explorations with a randomized candidate test set strategy to even out the search space explorations among the branches of the exploration trees constructed by the test inputs in the test suite . We report a validation experiment on a suite of four medium size benchmarks . The results show that our techniques achieve either higher APFD values than or the same mean APFD values as the existing code coverage based greedy or search based prioritization techniques including Genetic Greedy and ART in both our controlled experiment and case study . Our techniques are also significantly more efficient than the Genetic and Greedy but are less efficient than ART . 


Summary: We extend ART with the search based algorithm for test case prioritization. Our techniques are as effective as the best search based TCP technique. Our techniques are more efficient than genetic and greedy but not ART. It is the first experiment to evaluate input based search based TCP techniques.
Underlying network provides infrastructures for cloud computing in data centers . The server centric architectures integrate network and compute which place routing intelligence on servers . However the existing multi port server based architectures suffer from determined scale and large path length . In this paper we propose FleCube a flexibly connected architecture on multi port servers without using any switches . FleCube is recursively constructed on division of multiple ports in a server by means of complete graph . FleCube benefits data center networks by flexible scale and low diameter as well as large bisection width and small bottleneck degree . Furthermore we develop multi path routing to take advantage of parallel paths between any two servers . MPR adopts random forwarding to distribute traffic load and relieve network congestion . Analysis and comparisons with existing architectures show the advantages of FleCube . Evaluations under different degrees of network traffic demonstrate the merits of FleCube and the proposed routings . 


Summary: Propose novel directly connected architectures. Study the properties behind the novel architecture. Design the single path routing and multi path routing algorithm.
This work presents two low power Secure Hash Algorithm 3 designs on Field Programmable Gate Array using embedded Digital Signal Processing slice one for area constrained environments and the other for high speed applications . The seven equations of SHA 3 are logically optimized to three and four stage pipelined organizations for our compact and high speed designs respectively . The maximum parallelism between all the bitwise operations of different stages of SHA 3 is explored with respect to the 48 bit structure of DSP slice . Further Logical Cascade Structure design strategy is proposed in accordance with the DSP slice organization . These optimizations result in saving of resources and at the same time achieve low power with high performance . Our compact design results in saving of 79.10 DSP slices and consumes only 1 7 th of power while 1600 bit DSP design provides 23.57 Gbps throughput and consumes only 1 5 th of power as compared to the conventional SHA 3 designs . 


Summary: Two low power SHA 3 designs are provided on UltraScale FPGA using its embedded Digital Signal Processing DSP slice one for the area constrained environments and the other for high speed applications. All bitwise logical operations of SHA 3 are logically grouped in 48 bit wide parallel operations to get maximum benefit of Xilinx DSP48E2 slice structure. Logical Cascade Structure LCS strategy is used to confine maximum SHA 3 logic within same DSP slice column and also to get maximum benefit from its low power dedicated interconnect. The DSP based compact SHA 3 design utilizes 79.10 less DSP slices and consumes only 1 7th of power while high speed 1600 bit design provides 23.57 Gbps with consumption of only 1 5th of power.
New bounds on the magnitudes of the first and second order partial derivatives of rational triangular B zier surfaces are presented . Theoretical analysis shows that the proposed bounds are tighter than the existing ones . The superiority of the proposed new bounds is also illustrated by numerical tests . 


Summary: We present new bounds on the magnitudes of the lower derivatives of rational triangular Bezier surfaces. We theoretically prove that the proposed bounds are tighter than the existing ones. The superiority of the proposed new bounds is also illustrated by two types of numerical tests.
We present a simple method for C shaped Hermite interpolation by a rational cubic B zier curve with conic precision . For the interpolating rational cubic B zier curve we derive its control points according to two conic B zier curves both matching the Hermite data and one end curvature of the given Hermite data and the weights are obtained by the two given end curvatures . The conic precision property is based on the fact that the two conic B zier curves are the same when the given Hermite data are sampled from a conic . Both the control points and weights of the resulting rational cubic B zier curve are expressed in explicit form . 


Summary: The method reproduces a conic arc if the input data come from such a conic curve. The method can reproduce a whole conic curve even if it has singularities. The B zier control points have well understood geometrical meaning. The final rational B zier control points and weights are given in explicit form. Each of the tangential angles of the given tangent vectors can be arbitrary up to .