Search results for " set"
showing 10 items of 2095 documents
The molecular structure of N-hydroxyurea
1996
Ab initio calculations were performed on the tautomers and conformers of N-hydroxyurea using a 6-31G** basis set. The minimum-energy structures have been found and the importance of the intramolecular hydrogen bond as the stabilizing factor was pointed out. © 1996 John Wiley & Sons, Inc.
Fuzzy-set Qualitative Comparative Analysis (fsQCA): Guidelines for research practice in Information Systems and marketing
2021
Abstract The increasing interest in fuzzy-set Qualitative Comparative Analysis (fsQCA) in Information Systems and marketing raises the need for a tutorial paper that discusses the basic concepts and principles of the method, provide answers to typical questions that editors, reviewers, and authors would have when dealing with a new tool of analysis, and practically guide researchers on how to employ fsQCA. This article helps the reader to gain richer information from their data and understand the importance of avoiding shallow information‐from‐data reporting. To this end, it proposes a different research paradigm that includes asymmetric, configurational‐focused case‐outcome theory construc…
Automatic construction of test sets: Theoretical approach
2005
We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…
Optimizing Kernel Ridge Regression for Remote Sensing Problems
2018
Kernel methods have been very successful in remote sensing problems because of their ability to deal with high dimensional non-linear data. However, they are computationally expensive to train when a large amount of samples are used. In this context, while the amount of available remote sensing data has constantly increased, the size of training sets in kernel methods is usually restricted to few thousand samples. In this work, we modified the kernel ridge regression (KRR) training procedure to deal with large scale datasets. In addition, the basis functions in the reproducing kernel Hilbert space are defined as parameters to be also optimized during the training process. This extends the n…
Goal Setting and Monetary Incentives: When Large Stakes Are Not Enough
2012
The aim of this paper is to test the effectiveness of wage-irrelevant goal setting policies in a laboratory environment. In our design, managers can assign a goal to their workers by setting a certain level of performance on the work task. We establish our theoretical conjectures by developing a model in which assigned goals act as reference points to workers’ intrinsic motivation. Consistent with our model, we find that managers set goals which are challenging but attainable for an average-ability worker. Workers respond to these goals by increasing effort, performance and by decreasing on-the-job leisure activities with respect to the no-goal setting baseline. Finally, we study the intera…
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
2007
Abstract Background Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. However, the alignment methods seem inadequate for post-genomic studies since they do not scale well with data set size and they seem to be confined only to genomic and proteomic sequences. Therefore, alignment-free similarity measures are actively pursued. Among those, USM (Universal Similarity Metric) has gained prominence. It is based on the deep theory of Kolmogorov Complexity and universality is its most novel striking feature. Since it can only be approximated via data compression, USM is a methodology rath…
Combining conjunctive rule extraction with diffusion maps for network intrusion detection
2013
Network security and intrusion detection are important in the modern world where communication happens via information networks. Traditional signature-based intrusion detection methods cannot find previously unknown attacks. On the other hand, algorithms used for anomaly detection often have black box qualities that are difficult to understand for people who are not algorithm experts. Rule extraction methods create interpretable rule sets that act as classifiers. They have mostly been combined with already labeled data sets. This paper aims to combine unsupervised anomaly detection with rule extraction techniques to create an online anomaly detection framework. Unsupervised anomaly detectio…
Vagueness and Roughness
2008
The paper proposes a new formal approach to vagueness and vague sets taking inspirations from Pawlak's rough set theory. Following a brief introduction to the problem of vagueness, an approach to conceptualization and representation of vague knowledge is presented from a number of different perspectives: those of logic, set theory, algebra, and computer science. The central notion of the vague set, in relation to the rough set, is defined as a family of sets approximated by the so called lower and upper limits. The family is simultaneously considered as a family of all denotations of sharp terms representing a suitable vague term, from the agent's point of view. Some algebraic operations on…
Querying and reasoning over large scale building data sets
2016
International audience; The architectural design and construction domains work on a daily basis with massive amounts of data. Properly managing, exchanging and exploiting these data is an ever ongoing challenge in this domain. This has resulted in large semantic RDF graphs that are to be combined with a significant number of other data sets (building product catalogues, regulation data, geometric point cloud data, simulation data, sensor data), thus making an already huge dataset even larger. Making these big data available at high performance rates and speeds and into the correct (intuitive) formats is therefore an incredibly high challenge in this domain. Yet, hardly any benchmark is avai…
A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network
2009
International audience; We propose an efficient way of constructing the wireless mesh structure associated with Molecular MAC, a multichannel access method designed for efficient packet forwarding. We base our role assignment on a restricted Weakly Connected Dominating Set structure. After presenting a formal definition of the role assignment problem, we prove its NP-completeness. Then, we propose a centralized 2-approximation algorithm that maximizes the sum of radio link capacities in the molecular structure. Finally, we extend this protocol so that it can operate in a distributed way still providing the same guarantee. This distributed protocol is self-stabilizing thus robust to topology…