SoroushVahidi/scidocs huggingface dataset:
Analyzing and Managing Role-Based Access Control Policies
(2008)

Today more and more security-relevant data is stored on computer systems; security-critical business processes are mapped to their digital counterparts. This situation applies to various domains such as health care industry, digital government, and financial service institutes requiring that different security requirements must be fulfilled. Authorisation constraints can help the policy architect design and express higher-level organisational rules. Although the importance of authorisation constraints has been addressed in the literature, there does not exist a systematic way to verify and validate authorisation constraints. In this paper, we specify both non-temporal and history-based authorisation constraints in the Object Constraint Language (OCL) and first-order linear temporal logic (LTL). Based upon these specifications, we attempt to formally verify role-based access control policies with the help of a theorem prover and to validate policies with the USE system, a validation tool for OCL constraints. We also describe an authorisation engine, which supports the enforcement of authorisation constraints.
Greedy Layerwise Learning Can Scale to ImageNet
(2018)

Shallow supervised 1-hidden layer neural networks have a number of favorable properties that make them easier to interpret, analyze, and optimize than their deep counterparts, but lack their representational power. Here we use 1-hidden layer learning problems to sequentially build deep networks layer by layer, which can inherit properties from shallow networks. Contrary to previous approaches using shallow networks, we focus on problems where deep learning is reported as critical for success. We thus study CNNs on image classification tasks using the large-scale ImageNet dataset and the CIFAR-10 dataset. Using a simple set of ideas for architecture and training we find that solving sequential 1-hidden-layer auxiliary problems lead to a CNN that exceeds AlexNet performance on ImageNet. Extending this training methodology to construct individual layers by solving 2-and-3-hidden layer auxiliary problems, we obtain an 11-layer network that exceeds several members of the VGG model family on ImageNet, and can train a VGG-11 model to the same accuracy as end-to-end learning. To our knowledge, this is the first competitive alternative to end-to-end training of CNNs that can scale to ImageNet. We illustrate several interesting properties of these models theoretically and conduct a range of experiments to study the properties this training induces on the intermediate representations.
Rethinking the Value of Network Pruning
(2018)

Network pruning is widely used for reducing the heavy computational cost of 1 deep models. A typical pruning algorithm is a three-stage pipeline, i.e., training (a 2 large model), pruning and fine-tuning. In this work, we make a rather surprising 3 observation: fine-tuning a pruned model only gives comparable or even worse 4 performance than training that model with randomly initialized weights. Our 5 results have several implications: 1) training a large, over-parameterized model is 6 not necessary to obtain an efficient final model, 2) learned “important” weights 7 of the large model are not necessarily useful for the small pruned model, 3) the 8 pruned architecture itself, rather than a set of inherited weights, is what leads to the 9 efficiency benefit in the final model, which suggests that some pruning algorithms 10 could be seen as performing network architecture search. 11
Compact wideband directional antenna with three-dimensional structure for microwave-based head imaging systems
(2014)

Microwave-based head imaging systems demand wideband antennas with compact size. To ensure high scattered signals from the intended target point, the antennas need to have directional radiation patterns. Designing an antenna by addressing all these issues is challenging as the head imaging system utilizes low microwave frequencies (around 1-3 GHz) to maintain high signal penetration in the lossy human head. This paper reports a coplanar waveguide-fed design that overcomes all these limitations. The antenna is constructed in a three-dimensional manner by combining a dipole antenna with a folded parasitic structure printed on two substrate blocks. The antenna mechanism is explained with the description of its design parameters. The antenna covers 101% fractional bandwidth with a stable gain, good radiation efficiency and well directional radiation characteristics. The overall volume of the antenna is 0.24 × 0.1 × 0.05 λm where λm is the wavelength at the lowest frequency of operation.
A spiral antenna over a high-impedance surface consisting of fan-shaped patch cells
(2015)

Radiation characteristics of a spiral antenna over a high-impedance surface (HIS) are analyzed. The HIS consists of fan-shaped patch cells. The fan-shaped patches are arranged homogeneously in the circumferential direction but are set non-homogeneously in the radial direction. The analysis is performed using method of moment. Radiation characteristics of a spiral antenna with a perfect electric conductor (PEC) reflector are analyzed. It is reaffirmed that wideband radiation characteristics, including input impedance and axial ratio are deteriorate. Subsequently, Radiation characteristics of a spiral antenna with a fan-shaped HIS reflector are analyzed. It is revealed that input impedance and axial ratio are mitigated by replacing the PEC reflector with the fan-shaped HIS reflector.
Autoencoders, Unsupervised Learning, and Deep Architectures
(2012)

To better understand deep architectures and unsupervised learning, uncluttered by hardware details, we develop a general autoencoder framework for the comparative study of autoencoders, including Boolean autoencoders. We derive several results regarding autoencoders and autoencoder learning, including results on learning complexity, vertical and horizontal composition, and fundamental connections between critical points and clustering. Possible implications for the theory of deep architectures are discussed.
Accelerating Differential Evolution Using an Adaptive Local Search
(2008)

We propose a crossover-based adaptive local search (LS) operation for enhancing the performance of standard differential evolution (DE) algorithm. Incorporating LS heuristics is often very useful in designing an effective evolutionary algorithm for global optimization. However, determining a single LS length that can serve for a wide range of problems is a critical issue. We present a LS technique to solve this problem by adaptively adjusting the length of the search, using a hill-climbing heuristic. The emphasis of this paper is to demonstrate how this LS scheme can improve the performance of DE. Experimenting with a wide range of benchmark functions, we show that the proposed new version of DE, with the adaptive LS, performs better, or at least comparably, to classic DE algorithm. Performance comparisons with other LS heuristics and with some other well-known evolutionary algorithms from literature are also presented.
Hybrid Recommender Systems: Survey and Experiments
(2002)

Recommender systems represent user preferences for the purpose of suggesting items to purchase or examine. They have become fundamental applications in electronic commerce and information access, providing suggestions that effectively prune large information spaces so that users are directed toward those items that best meet their needs and preferences. A variety of techniques have been proposed for performing recommendation, including content-based, collaborative, knowledge-based and other techniques. To improve performance, these methods have sometimes been combined in hybrid recommenders. This paper surveys the landscape of actual and possible hybrid recommenders, and introduces a novel hybrid, EntreeC, a system that combines knowledge-based recommendation and collaborative filtering to recommend restaurants. Further, we show that semantic ratings obtained from the knowledge-based part of the system enhance the effectiveness of collaborative filtering.
Recommender Systems Research: A Connection-Centric Survey
(2004)

Recommender systems attempt to reduce information overload and retain customers by selecting a subset of items from a universal set based on user preferences. While research in recommender systems grew out of information retrieval and filtering, the topic has steadily advanced into a legitimate and challenging research area of its own. Recommender systems have traditionally been studied from a content-based filtering vs. collaborative design perspective. Recommendations, however, are not delivered within a vacuum, but rather cast within an informal community of users and social context. Therefore, ultimately all recommender systems make connections among people and thus should be surveyed from such a perspective. This viewpoint is under-emphasized in the recommender systems literature. We therefore take a connection-oriented perspective toward recommender systems research. We posit that recommendation has an inherently social element and is ultimately intended to connect people either directly as a result of explicit user modeling or indirectly through the discovery of relationships implicit in extant data. Thus, recommender systems are characterized by how they model users to bring people together: explicitly or implicitly. Finally, user modeling and the connection-centric viewpoint raise broadening and social issues—such as evaluation, targeting, and privacy and trust—which we also briefly address.
Method to find community structures based on information centrality.
(2004)

Community structures are an important feature of many social, biological, and technological networks. Here we study a variation on the method for detecting such communities proposed by Girvan and Newman and based on the idea of using centrality measures to define the community boundaries [M. Girvan and M. E. J. Newman, Proc. Natl. Acad. Sci. U.S.A. 99, 7821 (2002)]. We develop an algorithm of hierarchical clustering that consists in finding and removing iteratively the edge with the highest information centrality. We test the algorithm on computer generated and real-world networks whose community structure is already known or has been studied by means of other methods. We show that our algorithm, although it runs to completion in a time O(n4) , is very effective especially when the communities are very mixed and hardly detectable by the other methods.
Collaborative Recommendation via Adaptive Association Rule Mining
(2000)

Collaborative recommender systems allow personalization for e-commerce by exploiting similarities and dissimilarities among users' preferences. We investigate the use of association rule mining as an underlying technology for collaborative recommender systems. Association rules have been used with success in other domains. However, most currently existing association rule mining algorithms were designed with market basket analysis in mind. Such algorithms are ine cient for collaborative recommendation because they mine many rules that are not relevant to a given user. Also, it is necessary to specify the minimum support of the mined rules in advance, often leading to either too many or too few rules; this negatively impacts the performance of the overall system. We describe a collaborative recommendation technique based on a new algorithm speci cally designed to mine association rules for this purpose. Our algorithm does not require the minimum support to be speci ed in advance. Rather, a target range is given for the number of rules, and the algorithm adjusts the minimum support for each user in order to obtain a ruleset whose size is in the desired range. Rules are mined for a speci c target user, reducing the time required for the mining process. We employ associations between users as well as associations between items in making recommendations. Experimental evaluation of a system based on our algorithm reveals performance that is signi cantly better than that of traditional correlationbased approaches. Corresponding author. Present a liation: Department of Computer Science, Wellesley College, 106 Central Street, Wellesley, MA 02481 USA, e-mail: salvarez@wellesley.edu
Information rules - a strategic guide to the network economy
(1999)

Whatever our proffesion, information rules a strategic guide to the network economy can be good source for reading. Locate the existing reports of word, txt, kindle, ppt, zip, pdf, as well as rar in this website. You could completely review online or download this book by here. Currently, never ever miss it. Our goal is always to offer you an assortment of cost-free ebooks too as aid resolve your troubles. We have got a considerable collection of totally free of expense Book for people from every single stroll of life. We have got tried our finest to gather a sizable library of preferred cost-free as well as paid files. Have leisure times? Read information rules a strategic guide to the network economy writer by Why? A best seller book in the world with great value and also content is combined with appealing words. Where? Simply below, in this site you could review online. Want download? Certainly offered, download them also here. Available files are as word, ppt, txt, kindle, pdf, rar, and zip. GO TO THE TECHNICAL WRITING FOR AN EXPANDED TYPE OF THIS INFORMATION RULES A STRATEGIC GUIDE TO THE NETWORK ECONOMY, ALONG WITH A CORRECTLY FORMATTED VERSION OF THE INSTANCE MANUAL PAGE ABOVE.
Fuzzy Cognitive Map Learning Based on Nonlinear Hebbian Rule
(2003)

Fuzzy Cognitive Map (FCM) is a soft computing technique for modeling systems. It combines synergistically the theories of neural networks and fuzzy logic. The methodology of developing FCMs is easily adaptable but relies on human experience and knowledge, and thus FCMs exhibit weaknesses and dependence on human experts. The critical dependence on the expert's opinion and knowledge, and the potential convergence to undesired steady states are deficiencies of FCMs. In order to overcome these deficiencies and improve the efficiency and robustness of FCM a possible solution is the utilization of learning methods. This research work proposes the utilization of the unsupervised Hebbian algorithm to nonlinear units for training FCMs. Using the proposed learning procedure, the FCM modifies its fuzzy causal web as causal patterns change and as experts update their causal knowledge.
Emergence of 3D Printed Fashion: Navigating the Ambiguity of Materiality Through Collective Design
(2013)

The emergence of 3D printing technology is being embraced by an increasing number of fashion designers. Due to the nascent and evolving nature of the technology, however, there is significant ambiguity around this technology’s implications for the practices of fashion design. Based on the theoretical perspective of sociomateriality and the concept of translation, and drawing on archives, interviews, and other forms of qualitative data, this study’s preliminary findings show that fashion designers navigate this ambiguity by pursuing a collective design process with diverse stakeholders to actively perceive and leverage the affordances and constraints of the technology. The ongoing interaction among a network of heterogeneous actors gives rise to innovative perceptions, practices, and products, which collectively shape the emergence of the field of 3D printed fashion.
Addressing cold start in recommender systems: a semi-supervised co-training algorithm
(2014)

Cold start is one of the most challenging problems in recommender systems. In this paper we tackle the cold-start problem by proposing a context-aware semi-supervised co-training method named CSEL. Specifically, we use a factorization model to capture fine-grained user-item context. Then, in order to build a model that is able to boost the recommendation performance by leveraging the context, we propose a semi-supervised ensemble learning algorithm. The algorithm constructs different (weak) prediction models using examples with different contexts and then employs the co-training strategy to allow each (weak) prediction model to learn from the other prediction models. The method has several distinguished advantages over the standard recommendation methods for addressing the cold-start problem. First, it defines a fine-grained context that is more accurate for modeling the user-item preference. Second, the method can naturally support supervised learning and semi-supervised learning, which provides a flexible way to incorporate the unlabeled data.
 The proposed algorithms are evaluated on two real-world datasets. The experimental results show that with our method the recommendation accuracy is significantly improved compared to the standard algorithms and the cold-start problem is largely alleviated.
Learning Extractors from Unlabeled Text using Relevant Databases
(2007)

Supervised machine learning algorithms for information extraction generally require large amounts of training data. In many cases where labeling training data is burdensome, there may, however, already exist an incomplete database relevant to the task at hand. Records from this database can be used to label text strings that express the same information. For tasks where text strings do not follow the same format or layout, and additionally may contain extra information, labeling the strings completely may be problematic. This paper presents a method for training extractors which fill in missing labels of a text sequence that is partially labeled using simple high-precision heuristics. Furthermore, we improve the algorithm by utilizing labeled fields from the database. In experiments with BibTeX records and research paper citation strings, we show a significant improvement in extraction accuracy over a baseline that only relies on the database for training data.
Cloaker: Hardware Supported Rootkit Concealment
(2008)

Rootkits are used by malicious attackers who desire to run software on a compromised machine without being detected. They have become stealthier over the years as a consequence of the ongoing struggle between attackers and system defenders. In order to explore the next step in rootkit evolution and to build strong defenses, we look at this issue from the point of view of an attacker. We construct Cloaker, a proof-of-concept rootkit for the ARM platform that is non- persistent and only relies on hardware state modifications for concealment and operation. A primary goal in the design of Cloaker is to not alter any part of the host operating system (OS) code or data, thereby achieving immunity to all existing rootkit detection techniques which perform integrity, behavior and signature checks of the host OS. Cloaker also demonstrates that a self-contained execution environment for malicious code can be provided without relying on the host OS for any services. Integrity checks of hardware state in each of the machine's devices are required in order to detect rootkits such as Cloaker. We present a framework for the Linux kernel that incorporates integrity checks of hardware state performed by device drivers in order to counter the threat posed by rootkits such as Cloaker.
Detecting Driver Drowsiness Based on Sensors: A Review
(2012)

In recent years, driver drowsiness has been one of the major causes of road accidents and can lead to severe physical injuries, deaths and significant economic losses. Statistics indicate the need of a reliable driver drowsiness detection system which could alert the driver before a mishap happens. Researchers have attempted to determine driver drowsiness using the following measures: (1) vehicle-based measures; (2) behavioral measures and (3) physiological measures. A detailed review on these measures will provide insight on the present systems, issues associated with them and the enhancements that need to be done to make a robust system. In this paper, we review these three measures as to the sensors used and discuss the advantages and limitations of each. The various ways through which drowsiness has been experimentally manipulated is also discussed. We conclude that by designing a hybrid drowsiness detection system that combines non-intrusive physiological measures with other measures one would accurately determine the drowsiness level of a driver. A number of road accidents might then be avoided if an alert is sent to a driver that is deemed drowsy.
Comparative study of different methods of social network analysis and visualization
(2016)

A Social Network is a social structure made of individuals or organizations that are linked by one or more specific types of interdependency, such as friends, kinship, terrorist relation, conflict, financial exchange, disease transmission (epidemiology), airline routes etc. Social Network Analysis is an approach to the study of human or organization social interactions. It can be used to investigate kinship patterns, community structure or the organization of other formal and informal social networks. Recently, email networks have been popular source of data for both analysis and visualization of social network of a person or organization. In this paper, three types of visualization technique to analyze social networks have been considered - Force directed layout, Spherical layout and Clustered layout. Each method was evaluated with various data sets from an organization. Force directed layout is used to view the total network structure (Overview). Spherical layout is a 3D method to reveal communication patterns and relationships between different groups. Clustered graph layout visualizes a large amount of data in an efficient and compact form. It gives a hierarchical view of the network. Among the three methods, Clustered layout is the best to handle large network and group relationship. Finally, the comparative study of these three methods has been given.
A Systematic Analysis of XSS Sanitization in Web Application Frameworks
(2011)

While most research on XSS defense has focused on techniques for securing existing applications and re-architecting browser mechanisms, sanitization remains the industry-standard defense mechanism. By streamlining and automating XSS sanitization, web application frameworks stand in a good position to stop XSS but have received little research attention. In order to drive research on web frameworks, we systematically study the security of the XSS sanitization abstractions frameworks provide. We develop a novel model of the web browserions frameworks provide. We develop a novel model of the web browser and characterize the challenges of XSS sanitization. Based on the model, we systematically evaluate the XSS abstractions in 14 major commercially-used web frameworks. We find that frameworks often do not address critical parts of the XSS conundrum. We perform an empirical analysis of 8 large web applications to extract the requirements of sanitization primitives from the perspective of realworld applications. Our study shows that there is a wide gap between the abstractions provided by frameworks and the requirements of applications.
An integrated approach of diet and exercise recommendations for diabetes patients
(2014)

Diabetes is among one of the fastest growing disease all over the world. Controlled diet and proper exercise are considered as a treatment to control diabetes. However, food and exercise suggestions in existing solutions do not consider integrated knowledge from personal profile, preferences, current vital signs, diabetes domain, food domain and exercise domain. Furthermore, there is a strong correlation of diet and exercise. We have implemented an ontology based integrated approach to combine knowledge from various domains to generate diet and exercise suggestions for diabetics. The solution is developed as a Semantic Healthcare Assistant for Diet and Exercise (SHADE). For each domain (person, diabetes, food and exercise) we have defined separate ontology along with rules and then an integrated ontology combines these individual ontologies. Finally, diet recommendations are presented in the form of various alternative menus such that each menu is a healthy and balanced diet.