nils-herrmann/clean_scirepeval huggingface dataset:
Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models

In image processing, the Rudin-Osher-Fatemi (ROF) model [L. Rudin, S. Osher, and E. Fatemi, ), ] based on total variation (TV) minimization has proven to be very useful. A lot of efforts have been devoted to obtain fast numerical schemes and overcome the non-differentiability of the model. Methods considered to be particularly efficient for the ROF model include the dual methods of Chan-Golub-Mulet (CGM) [T.F. Chan, G.H. Golub, and P. Mulet,  20(1999), ] and Chambolle [A. Chambolle,  20(2004), pp. 89–97], and splitting and penalty based method [Y. Wang, J. Yang, W. Yin, and Y. Zhang,  1(2008), ], as well as split Bregman iteration [T. Goldstein, and S. Osher,  2(2009), pp. 323–343]. In this paper, we propose to use augmented Lagrangian method to solve the model. Convergence analysis will be given for the method. In addition, we observe close connections between the method proposed here and some of the existing methods. We show that the augmented Lagrangian method, dual methods, and split Bregman iteration are different iterative procedures to solve the same system. Moreover, the proposed method is extended to vectorial TV and high order models. Using the approach here, we can easily obtain the CGM dual method and split Bregman iteration for vectorial TV and high order models, which, to our best of knowledge, have not been presented in the literature. Numerical examples demonstrate the efficiency and accuracy of our method.
CMOS: Circuit Design, Layout, and Simulation

3. CMOS Circuit Design, Layout, And Simulation R. Jacob baker, Harry W. Li, David E. Boyce 3 Prentice Hall of India Pvt. Ltd. 4. CMOS Circuit Design, Layout, And Simulation R. Jacob baker, Harry W. Li, David E. Boyce 4 Prentice Hall of India Pvt. Ltd. 5. VHDL 3 edn Douglas Perry 5 6. Algorithms 3 edn in C++ Parts 1-4 Robert Sedgewick 6 Princeton University 7. VHDL Coding and Logic Synthesis with Synopsys Weng Fook Lee 7
Imaging without lenses: achievements and remaining challenges of wide-field on-chip microscopy

We discuss unique features of lens-free computational imaging tools and report some of their emerging results for wide-field on-chip microscopy, such as the achievement of a numerical aperture (NA) of ∼0.8–0.9 across a field of view (FOV) of more than 20 mm2 or an NA of ∼0.1 across a FOV of ∼18 cm2, which corresponds to an image with more than 1.5 gigapixels. We also discuss the current challenges that these computational on-chip microscopes face, shedding light on their future directions and applications.
On fast surface reconstruction methods for large and noisy point clouds

In this paper we present a method for fast surface reconstruction from large noisy datasets. Given an unorganized 3D point cloud, our algorithm recreates the underlying surface's geometrical properties using data resampling and a robust triangulation algorithm in near realtime. For resulting smooth surfaces, the data is resampled with variable densities according to previously estimated surface curvatures. Incremental scans are easily incorporated into an existing surface mesh, by determining the respective overlapping area and reconstructing only the updated part of the surface mesh. The proposed framework is flexible enough to be integrated with additional point label information, where groups of points sharing the same label are clustered together and can be reconstructed separately, thus allowing fast updates via triangular mesh decoupling. To validate our approach, we present results obtained from laser scans acquired in both indoor and outdoor environments.
A deep learning based stock trading model with 2-D CNN trend detection

The success of convolutional neural networks in the field of computer vision has attracted the attention of many researchers from other fields. One of the research areas in which neural networks is actively used is financial forecasting. In this paper, we propose a novel method for predicting stock price movements using CNN. To avoid the high volatility of the market and to maximize the profit, ETFs are used as primary financial assets. We extract commonly used trend indicators and momentum indicators from financial time series data and use these as our features. Adopting a sliding window approach, we generate our images by taking snapshots that are bounded by the window over a daily period. We then perform daily predictions, namely, regression for predicting the ETF prices and classification for predicting the movement of the prices on the next day, which can be modified to estimate weekly or monthly trends. To increase the number of images, we use numerous ETFs. Finally, we evaluate our method by performing paper trading and calculating the final capital. We also compare our method's performance to commonly used classical trading strategies. Our results indicate that we can predict the next day's prices with 72% accuracy and end up with 5:1 of our initial capital, taking realistic values of transaction costs into account.
Learning Semantically Coherent and Reusable Kernels in Convolution Neural Nets for Sentence Classification

The purpose of this work is to empirically study desirable properties such as semantic coherence, attention mechanism and kernel reusability in Convolution Neural Networks (CNNs) for learning sentence classification tasks. We propose to learn semantically coherent kernels using clustering scheme combined with Word2Vec representation and domain knowledge such as SentiWordNet. We also suggest a technique to visualize attention mechanism of CNNs. These ideas are useful for decision explanation purpose. Reusable property enables kernels learned on one problem to be used in another problem. This helps in efficient learning as only a few additional domain specific kernels may have to be learned. Experimental results demonstrate the usefulness of our approach. The performance of the proposed approach, which uses semantic and re-usability properties, is close to that of the state-of-the-art approaches on many real-world datasets.
Chapter 17 Wireless Sensor Network Security : A Survey

As wireless sensor networks continue to grow, so does the need for effective security mechanisms. Because sensor networks may interact with sensitive data and/or operate in hostile unattended environments, it is imperative that these security concerns be addressed from the beginning of the system design. However, due to inherent resource and computing constraints, security in sensor networks poses different challenges than traditional network/computer security. There is currently enormous research potential in the field of wireless sensor network security. Thus, familiarity with the current research in this field will benefit researchers greatly. With this in mind, we survey the major topics in wireless sensor network security, and present the obstacles and the requirements in the sensor security, classify many of the current attacks, and finally list their corresponding defensive measures.
Level Lines based Disocclusion

Object recognition, robotic vision, occluding noise removal or photograph design require the ability to perform disocclusion. We call disocclusion the recovery of hidden parts of objects in a digital image by interpolation from the vicinity of the occluded area. It is shown in this paper how disocclusion can be performed by means of level lines structure, which offers a reliable, complete and contrast-invariant representation of image, in contrast to edges. Level lines based disocclusion yields a solution that may have strong discontinuities, which is not possible with PDE-based interpolation. Moreover, the proposed method is fully compatible with Kanizsa’s theory of “amodal completion”.
Tailoring ERP Systems: A Spectrum of Choices and their Implications

The IS literature distinguishes between custom-built and off-the-shelf software. Enterprise resource planning (ERP) packages are often viewed as off-the-shelf software, because adopters implement them by setting parameters (called configuration), rather than by traditional programming. Making changes to ERP software code (called modification) is usually strongly discouraged by vendors and implementation consultants. Nevertheless, field research has shown that many companies have had to modify ERP software in various ways to meet essential business needs. This suggests that ERP packages do not fit cleanly into the custom/off-theshelf distinction. In this paper, we describe a portfolio of tailoring options between configuration and modification, with important implications for implementation risk and the difficulty of ERP system upgrades. We discuss the implications of our framework for practitioners and for further research on ERP systems.
Neural Network training model for weather forecasting using Fireworks Algorithm

Weather forecasting is the application of science and technology in order to predict the weather conditions. It is important for agricultural and industrial sectors. Models of Artificial Neural Networks with supervised learning paradigm are suitable for weather forecasting in complexity atmosphere. Training algorithm is required for providing weight and bias values to the model. This research proposed a weather forecasting method using Artificial Neural Networks trained by Fireworks Algorithm. Fireworks Algorithm is a recently developed Swarm Intelligence Algorithm for optimization. The main objective of the method is to predict daily mean temperature based on various measured parameters gained from the Meteorological Station, located in Bangkok. The experimental results indicate that the proposed method is advantageous for weather forecasting.
Social trust and social reciprocity based cooperative D2D communications

Thanks to the convergence of pervasive mobile communications and fast-growing online social networking, mobile social networking is penetrating into our everyday life. Aiming to develop a systematic understanding of the interplay between social structure and mobile communications, in this paper we exploit social ties in human social networks to enhance cooperative device-to-device communications. Specifically, as hand-held devices are carried by human beings, we leverage two key social phenomena, namely social trust and social reciprocity, to promote efficient cooperation among devices. With this insight, we develop a coalitional game theoretic framework to devise social-tie based cooperation strategies for device-to-device communications. We also develop a network assisted relay selection mechanism to implement the coalitional game solution, and show that the mechanism is immune to group deviations, individually rational, and truthful. We evaluate the performance of the mechanism by using real social data traces. Numerical results show that the proposed mechanism can achieve up-to 122% performance gain over the case without D2D cooperation.
Minimum Text Corpus Selection for Limited Domain Speech Synthesis

This paper concerns limited domain TTS system based on the concatenative method, and presents an algorithm capable to extract the minimal domainoriented text corpus from the real data of the given domain, while still reaching the maximum coverage of the domain. The proposed approach ensures that the least amount of texts are extracted, containing the most common phrases and (possibly) all the words from the domain. At the same time, it ensures that appropriate phrase overlapping is kept, allowing to find smooth concatenation in the overlapped regions to reach high quality synthesized speech. In addition, several recommendations allowing a speaker to record the corpus more fluently and comfortably are presented and discussed. The corpus building is tested and evaluated on several domains differing in size and nature, and the authors present the results of the algorithm and demonstrate the advantages of using the domain oriented corpus for speech synthesis.
Automatically Tagging Constructions of Causation and Their Slot-Fillers

This paper explores extending shallow semantic parsing beyond lexical-unit triggers, using causal relations as a test case. Semantic parsing becomes difficult in the face of the wide variety of linguistic realizations that causation can take on. We therefore base our approach on the concept of constructions from the linguistic paradigm known as Construction Grammar (CxG). In CxG, a construction is a form/function pairing that can rely on arbitrary linguistic and semantic features. Rather than codifying all aspects of each construction’s form, as some attempts to employ CxG in NLP have done, we propose methods that offload that problem to machine learning. We describe two supervised approaches for tagging causal constructions and their arguments. Both approaches combine automatically induced pattern-matching rules with statistical classifiers that learn the subtler parameters of the constructions. Our results show that these approaches are promising: they significantly outperform naïve baselines for both construction recognition and cause and effect head matches.
The Lone-Actor Terrorist and the TRAP-18

An open source sample of 111 lone-actor terrorists from the United States and Europe were studied through the lens of the Terrorist Radicalization Assessment Protocol (TRAP-18). This investigative template consists of 8 proximal warning behaviors and 10 distal characteristics for active risk management or active monitoring, respectively, by national security threat assessors. Several aspects of criterion validity were tested in this known outcome sample. Seventy percent of the terrorists were positive for at least half or more of the indicators. When the sample was divided into Islamic extremists, right-wing extremists, and single-issue terrorists, there were no significant differences across all 18 indicators except for 4. When the sample was divided according to successful versus thwarted attackers, the successful attackers were significantly more fixated, creative, and innovative, and failed to have a prior sexually intimate pair bond. They were significantly less likely to have displayed pathway warning behavior and be dependent on a virtual community of likeminded true believers. Effect sizes were small to medium (! " 0.190–0.317). The TRAP-18 appears to have promise as an eventual structured professional judgment risk assessment instrument according to some of the individual terrorist content domains outlined by Monahan (2012, 2016).
Three Classes of Deep Learning Architectures and Their Applications: A Tutorial Survey

In this invited paper, my overview material on the same topic as presented in the plenary overview session of APSIPA-2011 and the tutorial material presented in the same conference (Deng, 2011) are expanded and updated to include more recent developments in deep learning. The previous and the updated materials cover both theory and applications, and analyze its future directions. The goal of this tutorial survey is to introduce the emerging area of deep learning or hierarchical learning to the APSIPA community. Deep learning refers to a class of machine learning techniques, developed largely since 2006, where many stages of nonlinear information processing in hierarchical architectures are exploited for pattern classification and for feature learning. In the more recent literature, it is also connected to representation learning, which involves a hierarchy of features or concepts where higher-level concepts are defined from lower-level ones and where the same lower-level concepts help to define higher-level ones. In this tutorial, a brief history of deep learning research is discussed first. Then, a classificatory scheme is developed to analyze and summarize major work reported in the deep learning literature. Using this scheme, I provide a taxonomy-oriented survey on the existing deep architectures and algorithms in the literature, and categorize them into three classes: generative, discriminative, and hybrid. Three representative deep architectures --deep auto-encoder, deep stacking network, and deep neural network (pre-trained with deep belief network) --one in each of the three classes, are presented in more detail. Next, selected applications of deep learning are reviewed in broad areas of signal and information processing including audio/speech, image/vision, multimodality, language modeling, natural language processing, and information retrieval. Finally, future directions of deep learning are discussed and analyzed.
A Definition of Artificial Intelligence

In this paper we offer a formal definition of Artificial Intelligence and this directly gives us an algorithm for construction of this object. Really, this algorithm is useless due to the combinatory explosion. The main innovation in our definition is that it does not include the knowledge as a part of the intelligence. So according to our definition a newly born baby also is an Intellect. Here we differs with Turing's definition which suggests that an Intellect is a person with knowledge gained through the years.
Height and gradient from shading

The method described here for recovering the shape of a surface from a shaded image can deal with complex, wrinkled surfaces. Integrability can be enforced easily because both surface height and gradient are represented. (A gradient field is integrable if it is the gradient of some surface height function.) The robustness of the method stems in part from linearization of the reflectance map about the current estimate of the surface orientation at each picture cell. (The reflectance map gives the dependence of scene radiance on surface orientation.) The new scheme can find an exact solution of a given shape-from-shading problem even though a regularizing term is included. The reason is that the penalty term is needed only to stabilize the iterative scheme when it is far from the correct solution; it can be turned off as the solution is approached. This is a reflection of the fact that shape-from-shading problems are not ill posed when boundary conditions are available, or when the image contains singular points. This article includes a review of previous work on shape from shading and photoclinometry. Novel features of the new scheme are introduced one at a time to make it easier to see what each contributes. Included is a discussion of implementation details that are important if exact algebraic solutions of synthetic shape-from-shading problems are to be obtained. The hope is that better performance on synthetic data will lead to better performance on real data.
Segmented handwritten text recognition with recurrent neural network classifiers

Recognition of handwritten text is a useful technique that can be applied in different applications, such as signature recognition, bank check recognition, etc. However, the off-line handwritten text recognition in an unconstrained situation is still a very challenging task due to the high complexity of text strokes and image background. This paper presents a novel segmented handwritten text recognition technique that ensembles recurrent neural network (RNN) classifiers. Two RNN models are first trained that take advantage of the widely used geometrical feature and the Histogram of Oriented Gradient (HOG) feature, respectively. Given a handwritten word image, the optimal recognition result is then obtained by integrating the two trained RNN models together with a lexicon. Experiments on public datasets show the superior performance of our proposed technique.
Automatic Building of Synthetic Voices from Audio Books

Current state-of-the-art text-to-speech systems produce intelligible speech but lack the prosody of natural utterances. Building better models of prosody involves development of prosodically rich speech databases. However, development of such speech databases requires a large amount of effort and time. An alternative is to exploit story style monologues (long speech files) in audio books. These monologues already encapsulate rich prosody including varied intonation contours, pitch accents and phrasing patterns. Thus, audio books act as excellent candidates for building prosodic models and natural sounding synthetic voices. The processing of such audio books poses several challenges including segmentation of long speech files, detection of mispronunciations, extraction and evaluation of representations of prosody. In this thesis, we address the issues of segmentation of long speech files, capturing prosodic phrasing patterns of a speaker, and conversion of speaker characteristics. Techniques developed to address these issues include – text-driven and speech-driven methods for segmentation of long speech files; an unsupervised algorithm for learning speaker-specific phrasing patterns and a voice conversion method by modeling target speaker characteristics. The major conclusions of this thesis are – • Audio books can be used for building synthetic voices. Segmentation of such long speech files can be accomplished without the need for a speech recognition system. • The prosodic phrasing patterns are specific to a speaker. These can be learnt and incorporated to improve the quality of synthetic voices. • Conversion of speaker characteristics can be achieved by modeling speaker-specific features of a target speaker. Finally, the techniques developed in this thesis enable prosody research by leveraging a large number of audio books available in the public domain.
Location Segmentation, Inference and Prediction for Anticipatory Computing

This paper presents an analysis of continuous cellular tower data representing five months of movement from 215 randomly sampled subjects in a major urban city. We demonstrate the potential of existing community detection methodologies to identify salient locations based on the network generated by tower transitions. The tower groupings from these unsupervised clustering techniques are subsequently validated using data from Bluetooth beacons placed in the homes of the subjects. We then use these inferred locations as states within several dynamic Bayesian networks to predict each subject’s subsequent movements with over 90% accuracy. We also introduce the X-Factor model, a DBN with a latent variable corresponding to abnormal behavior. We conclude with a description of extensions for this model, such as incorporating additional contextual and temporal variables already being logged by the
Digital Clock and Data Recovery Circuits for Optical Links

Clock and Data Recovery (CDR) circuits perform the function of recovering clock and re-timing received data in optical links. These CDRs must be capable of tolerating large input jitter (high JTOL), filter input jitter (low JTRAN with no jitter peaking) and in burst-mode applications be capable of phase locking in a very short time. In this paper, we elucidate these design tradeoffs and present various CDR architectures that can overcome them. Specifically, D/PLL CDR architecture that achieves high JTOL, low JTRAN, and no jitter peaking is described. A new burst-mode CDR that can lock instantaneously while filtering input jitter is also discussed.
Accelerating Asynchronous Stochastic Gradient Descent for Neural Machine Translation

In order to extract the best possible performance from asynchronous stochastic gradient descent one must increase the mini-batch size and scale the learning rate accordingly. In order to achieve further speedup we introduce a technique that delays gradient updates effectively increasing the mini-batch size. Unfortunately with the increase of mini-batch size we worsen the stale gradient problem in asynchronous stochastic gradient descent (SGD) which makes the model convergence poor. We introduce local optimizers which mitigate the stale gradient problem and together with fine tuning our momentum we are able to train a shallow machine translation system 27% faster than an optimized baseline with negligible penalty in BLEU.