SoroushVahidi/scidocs huggingface dataset:
Necessary Conditions for Existence of Some Designs in Polynomial Metric Spaces
(1999)

Let M be a metric space with a finite diameter D and a finite normalized measure μM. Let the Hilbert space L2(M) of complex-valued functions be decomposed into a countable (whenM is infinite) or finite (with D+ 1 members whenM is finite) direct sum of mutually orthogonal subspaces L2(M) = V0 ⊕ V1 ⊕ · · · (V0 is the space of constant functions). We denote N = D + 1 ifM is finite and N = ∞ otherwise. In definition and description of the notion of polynomial metric spaces we follow [26, 27].
On Maximal Spherical Codes I
(1995)

We investigate the possibilities for attaining two Levenshtein upper bounds for spherical codes. We find the distance distributions of all codes meeting these bounds. Then we show that the fourth Levenshtein bound can be attained in some very special cases only. We prove that no codes with an irrational maximal scalar product meet the third Levenshtein bound. So in dimensions 3 ≤ n ≤ 100 exactly seven codes are known to attain this bound and ten cases remain undecided. Moreover, the first two codes (in dimensions 5 and 6) are unique up to isometry. Nonexistence of maximal codes in all dimensions n with cardinalities between 2n+1 and 2n+ [7 √ n ] is shown as well. We prove nonexistence of several infinite families of maximal codes whose maximal scalar product is rational. The distance distributions of the only known nontrivial infinite family of maximal codes (due to Levenshtein) are given.
Interpolation and approximation in L2(gamma)
(2007)

Assume a standard Brownian motion W = (Wt )t∈[0,1], a Borel function f : R → R such that f (W1) ∈ L2, and the standard Gaussian measure on the real line. We characterize that f belongs to the Besov space B 2,q ( ) := (L2( ), D1,2( )) ,q , obtained via the real interpolation method, by the behavior of aX(f (X1); ) := ‖f (W1)−P Xf (W1)‖L2 , where =(ti )ni=0 is a deterministic time net and P X : L2 → L2 the orthogonal projection onto a subspace of ‘discrete’stochastic integrals x0+ ∑n i=1 vi−1(Xti −Xti−1) with X being the Brownian motion or the geometric Brownian motion. By using Hermite polynomial expansions the problem is reduced to a deterministic one. The approximation numbers aX(f (X1); ) can be used to describe the L2-error in discrete time simulations of the martingale generated by f (W1) and (in stochastic finance) to describe the minimal quadratic hedging error of certain discretely adjusted portfolios. © 2006 Elsevier Inc. All rights reserved.
Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities
(1999)

A sphericalτ -design onSn−1 is a finite set such that, for all polynomials f of degree at most τ , the average of over the set is equal to the average of f over the sphere Sn−1. In this paper we obtain some necessary conditions for the existence of designs of odd strengths and cardinalities. This gives nonexistence results in many cases. Asymptotically, we derive a bound which is better than the corresponding estimation ensured by the Delsarte– Goethals–Seidel bound. We consider in detail the strengths τ = 3 andτ = 5 and obtain further nonexistence results in these cases. When the nonexistence argument does not work, we obtain bounds on the minimum distance of such designs.
Image Steganography based on a Parameterized Canny Edge Detection Algorithm
(2016)

Steganography is the science of hiding digital information in such a way that no one can suspect its existence. Unlike cryptography which may arouse suspicions, steganography is a stealthy method that enables data communication in total secrecy. Steganography has many requirements, the foremost one is irrecoverability which refers to how hard it is for someone apart from the original communicating parties to detect and recover the hidden data out of the secret communication. A good strategy to guaranteeirrecoverability is to cover the secret data not usinga trivial method based on a predictable algorithm, but using a specific random pattern based on a mathematical algorithm. This paper proposes an image steganography technique based on theCanny edge detection algorithm. It is designed to hide secret data into a digital image within the pixels that make up the boundaries of objects detected in the image. More specifically, bits of the secret data replace the three LSBs of every color channel of the pixels detected by the Canny edge detection algorithm as part of the edges in the carrier image. Besides, the algorithm is parameterized by three parameters: The size of the Gaussian filter, a low threshold value, and a high threshold value. These parameters can yield to different outputs for the same input image and secret data. As a result, discovering the inner-workings of the algorithm would be considerably ambiguous, misguiding steganalysts from the exact location of the covert data. Experiments showed a simulation tool codenamed GhostBit, meant to cover and uncover secret data using the proposed algorithm. As future work, examining how other image processing techniques such as brightness and contrast adjustment can be taken
Comparative analysis of master-slave latches and flip-flops for high-performance and low-power systems
(1999)

In this paper, we propose a set of rules for consistent estimation of the real performance and power features of the flip-flop and master–slave latch structures. A new simulation and optimization approach is presented, targeting both highperformance and power budget issues. The analysis approach reveals the sources of performance and power-consumption bottlenecks in different design styles. Certain misleading parameters have been properly modified and weighted to reflect the real properties of the compared structures. Furthermore, the results of the comparison of representative master–slave latches and flipflops illustrate the advantages of our approach and the suitability of different design styles for high-performance and low-power applications.
Dual-band microstrip antenna for WiMAX applications using complementary split ring resonators
(2016)

A new design of dual-band microstrip antenna is presented in this paper using metamaterial concept. By etching a metamaterial unit cells that have a resonance frequency of 5.3 GHz within the ground plane of a conventional patch resonates at 3.6 GHz, a dual resonance response is created to satisfy the requirement of covering the middle and upper bands of Wi-MAX.A detailed study of the placement of the unit cell is introduced and the most suitable one is chosen to be the place of our unit cell. Multi-unit cell concept is used for performance enhancement of the fabricated design to achieve a good matching with the simulated one.
A Two-Level Investigation of Information Systems Outsourcing
(1996)

O UTSOURCING is the contracting of various systems to outside information systems (IS) vendors. Ever since the Eastman Kodak--IBM partnership was reported in 1989 [15], outsourcing has emerged and has been recognized as a key method of managing IS. In previous studies of outsourcing [4, 5, 12, 15, 17, 20], two gaps are noticeable. The first relates to the fact that requirements for outsourcing are not uniform, and managers have different approaches to the process. Yet most previous research studies have phrased their inquiries unidimensionally in terms of the extent or degree of outsourcing: either as a binary variable or as size of contract in terms of the percentage of total IS budget [5, 15]. Neither unidimensional gauge is sufficiently expressive; neither allows representation of diverse patterns of outsourcing. Second, even though the IS industry had not used the term “outsourcing” explicitly in the past, outsourcing is not a new concept and has existed for many years in one form or another. Even though firms have repetitively used outside vendors for years, researchers have neither considered prior relationships in their studies of IS outsourcing nor studied the intentions of client firms to continue the partnership with the outsourcing vendors in the future. In this study, IS outsourcing decisions are investigated at two levels. The first level deals with the initial outsourcing decision of client firms. The second level pertains to the intention to continue the relationships with current outsourcing vendors in the future. The following three research questions are explored at these two levels (in contrast to the singlelevel approach taken by most researchers): • What are the dimensions of outsourcing decisions? Two dimensions, extent of substitution by vendors and strategic impact of IS applications, are proposed in order to conceptualize the diverse types of outsourcing relationships between clients and vendors. Based on these two dimensions, four types of outsourcing relationships are proposed. • What are the determinants that affect the dimensions of outsourcing decisions at the first level? The concepts derived from incomplete contracts [2, 9] and transactions cost economics [23, 24] theory are used with information technology (IT) organizational contexts and processes as a foundation to study the determinants of the two dimensions of outsourcing decisions. Information Syst
Design of Low Actuation Voltage RF MEMS Switch
(2000)

Low-loss microwave microelectromechanical systems (MEMS) shunt switches are reported that utilize highly compliant serpentine spring folded suspensions together with large area capacitive actuators to achieve low actuation voltages while maintaining sufficient off-state isolation. The RF MEMS switches were fabricated via a surface micromachining process using PI2545 Polyimide 1 as the sacrificial layer. The switch structure was composed of electroplated nickel and the serpentine folded suspensions had varying number of meanders from 1 to 5. DC measurements indicate actuation voltages as low as 9 V with an on-to-off capacitance ratio of 48. Power handling measurement results showed no ”selfbiasing” or failure of the MEMS switches for power levels up to 6.6W. RF measurements demonstrate an isolation of -26 dB at 40 GHz.
Comparison of different methods to cancel offset capacitance in capacitive displacement sensors
(2012)

This paper presents a comparative study of the power consumption of two methods to cancel the offset capacitance in high-resolution capacitive displacement sensors. One method is applied based on correlated-double-sampling (CDS) technique and the other method is applied using oversampling technique. The analytical comparison predicts similar power consumption, if the same resolution for the same conversion time need to be reached. Experimental results with implementations of the two methods confirmed the analytical prediction.
From IT Addiction to Discontinued Use: A Cognitive Dissonance Perspective
(2017)

One of the main topics discussed within the realm of the dark side of IT is addiction. IT addiction has been found to bring adverse consequences on users’ lives. In order to overcome the difficulties associated with IT addiction, interrupting and quitting addiction has become an important research agenda. Recent research findings have shown that IT addicts do not always feel guilty about their usage, and in many cases, they do not even perceive their usage as problematic. In this study, we draw on cognitive dissonance theory to theorize and propose a model showing that the degree of users’ cognitive dissonance can make a difference in their willingness to quit their IT addiction. We tested the model using data collected from 226 social network sites users. The analysis provided empirical support for our model and shed light on the mediation and moderation effects of cognitive dissonance in this process. 1
Comparison of Internet addicts and non-addicts in Taiwanese high school
(2007)

This study investigated the difference between Internet addicts and non-addicts in Taiwanese high schools, and focused specifically on their Internet usage patterns, and gratification and communication pleasures. A total of 1708 valid data samples of high school adolescents were collected. Among this sample, 236 subjects (13.8%) were identified as addicts using the eight-item Internet addiction Diagnostic Questionnaire designed by Young [Internet addiction survey [Online]. Available: http://www.pitt.edu/_ksy/survey.htm]. The analytical results revealed that Internet addicts spent almost twice as many hours on line on average than the non-addicts. Notably, surfing with a social/entertainment motivation and gratification was positively correlated with Internet addiction. Furthermore, Internet addicts obtained markedly higher overall PIUST scores and scored higher than non-addicts on four subscales (tolerance; compulsive use and withdrawal; related problems, including family, school, health, and other problems; interpersonal and financial problems). While Internet addicts perceived the Internet to have significantly more negative influences on daily routines, school performance, teacher and parental relation than non-addicts, both Internet addicts and non-addicts viewed Internet use as enhancing peer relations. Moreover, students with personalities characterized by dependence, shyness, depression and low self-esteem had a high tendency to become addicted. 2004 Elsevier Ltd. All rights reserved.
Scheduling in the Dark ( Improved Result )
(2007)

We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when either the jobs all arrive at time zero, or when all the jobs are fully parallelizable, or when the scheduler has considerable knowledge about the jobs. This paper considers for the first time this problem without any of these three restrictions yet when our algorithm is given more resources than the adversary. We provide new upper and lower bound techniques applicable in this more difficult scenario. The results are of both theoretical and practical interest. In our model, a job can arrive at any arbitrary time and its execution characteristics can change through the life of the job from being anywhere from fully parallelizable to completely sequential. We assume that the scheduler has no knowledge about the jobs except for knowing when a job arrives and knowing when it completes. (This is why we say that the scheduler is completely in the dark.) Given all this, we prove that the scheduler algorithm Equi-partition, though simple, performs within a constant factor as well as the optimal scheduler as long as it is given at least twice as many processors. More over, we prove that if none of the jobs are ”strictly” fully parallelizable, then Equi-partition performs competitively with no extra processors. Author is supported by NSERC Canada.
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
(2008)

The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2 in the worst case for infinite languages, and for finite languages it is n log n) and n , if the alphabet size grows with the number of states n of the given automaton. A new lower bound method based on communication complexity for regular expression size is developed to show that the required size is indeed n . For constant alphabet size the best lower bound known to date is Ω(n), even when allowing infinite languages and nondeterministic finite automata. As the technique developed here works equally well for deterministic finite automata over binary alphabets, the lower bound is improved to n .
Quantifying the Security Posture of Containerized Mission Critical Systems
(2018)

Determining the security posture of containerized mission-critical systems is difficult given the vast number of parameters that determine a system's ability to withstand cyber-attacks. In many cases, technical audits can be performed to determine a system's security posture and to evaluate how well they are configured to protect against known cyber-threats. Properly configuring systems can lead to higher security, however, the configuration and auditing process can be time-consuming and error-prone. In addition, the results obtained from these audits can be difficult to summarize into one meaningful metric that accurately characterizes system's security posture as guided by customer needs. In this work, we propose an approach for computing a security-posture metric for containerized systems that supports operators during the sense-making process that follows traditional security audits. The results of this work can be used on a per-deployment case, taking into account what matters to operators of containerized mission-critical systems.
Intelligent Heart Disease Prediction System Using Probabilistic Neural Network
(2013)

The diagnosis of diseases is a crucial and difficult job in medicine. The recognition of heart disease from diverse features or signs is a multi-layered problem that is not free from false assumptions and is frequently accompanied by hasty effects [1]. Thus an attempt to exploit knowledge and experience of several specialists and clinical screening data of patients composed in databases to assist the diagnosis procedure is regarded as a great challenge. The healthcare industry gathers enormous amounts of heart disease data that unfortunately, are not mined to determine concealed information for effective diagnosing [2]. In this paper, an efficient approach for the intelligent heart disease prediction based on Probabilistic Neural Network (PNN) technique is proposed. Initially, the data set containing 13 medical attributes were obtained from the Cleveland heart disease database. The dataset is clustered with the aid of k-means clustering algorithm. The PNN with radial basis function is trained using the selected data sets. The comparison between existing approaches and proposed approach with respect to accuracy of prediction, sensitivity and specificity is recorded in this paper. The results from experiments returned with diminishing fact that there is considerable improvement in classification and prediction. The proposed PNN works as promising tool for prediction of heart disease.
Requirements for Safe Robots : Measurements , Analysis and New Insights
(2009)

Physical human–robot interaction and cooperation has become a topic of increasing importance and of major focus in robotics research. An essential requirement of a robot designed for high mobility and direct interaction with human users or uncertain environments is that it must in no case pose a threat to the human. Until recently, quite a few attempts were made to investigate real-world threats via collision tests and use the outcome to considerably improve safety during physical human–robot interaction. In this paper, we give an overview of our systematic evaluation of safety in human–robot interaction, covering various aspects of the most significant injury mechanisms. In order to quantify the potential injury risk emanating from such a manipulator, impact tests with the DLR-Lightweight Robot III were carried out using standard automobile crash test facilities at the German Automobile Club (ADAC). Based on these tests, several industrial robots of different weight have been evaluated and the influence of the robot mass and velocity have been investigated. The evaluated non-constrained impacts would only partially capture the nature of human–robot safety. A possibly constrained environment and its effect on the resulting human injuries are discussed and evaluated from different perspectives. As well as such impact tests and simulations, we have analyzed the problem of the quasi-static constrained impact, which could pose a serious threat to the human even for low-inertia robots under certain circumstances. Finally, possible injuries relevant in robotics are summarized and systematically classified. KEY WORDS—Physical Human-Robot Interaction, Simulation, Flexible Arms, Mechanics, Design and Control, Force Control The International Journal of Robotics Research Vol. 00, No. 00, Xxxxxxxx 2009, pp. 000–000 DOI: 10.1177/0278364909343970 c The Author(s), 2009. Reprints and permissions: http://www.sagepub.co.uk/journalsPermissions.nav Figures 1–10, 12–18 appear in color online: http://ijr.sagepub.com
Sego: Pervasive Trusted Metadata for Efficiently Verified Untrusted System Services
(2016)

Sego is a hypervisor-based system that gives strong privacy and integrity guarantees to trusted applications, even when the guest operating system is compromised or hostile. Sego verifies operating system services, like the file system, instead of replacing them. By associating trusted metadata with user data across all system devices, Sego verifies system services more efficiently than previous systems, especially services that depend on data contents. We extensively evaluate Sego's performance on real workloads and implement a kernel fault injector to validate Sego's file system-agnostic crash consistency and recovery protocol.
A Data Driven Approach for Algebraic Loop Invariants
(2013)

We describe a new algorithm GUESS-AND-CHECK for computing algebraic equation invariants. These invariants are of the form ∧ifi(x1, . . . , xn) = 0, where each fi is a polynomial over the variables x1, . . . , xn of the program. Two novel features of our algorithm are:(1) it is data driven, that is, invariants are derived from data generated from concrete executions of the program, and (2) it is sound and complete, that is, the algorithm terminates with the correct invariant if it exists. The GUESS-AND-CHECK algorithm proceeds iteratively in two phases. The “guess” phase uses linear algebra techniques to efficiently derive a candidate invariant from data. This candidate invariant is subsequently validated in a “check” phase. If the check phase fails to validate the candidate invariant, then the proof of invalidity is used to generate more data and this is used to find better candidate invariants in a subsequent guess phase. Therefore, GUESS-AND-CHECK iteratively invokes the guess and check phases until it finds the desired invariant. In terms of implementation, off-the-shelf linear algebra solvers are used to implement the guess phase, and off-the-shelf decision procedures are used to implement the check phase. We have evaluated our technique on a number of benchmark programs from recent papers on invariant generation. Our results are encouraging – we are able to efficiently compute algebraic invariants in all cases.