SoroushVahidi/scidocs huggingface dataset:
High-Resolution Image Inpainting Using Multi-scale Neural Patch Synthesis
(2017)

Recent advances in deep learning have shown exciting promise in filling large holes in natural images with semantically plausible and context aware details, impacting fundamental image manipulation tasks such as object removal. While these learning-based methods are significantly more effective in capturing high-level features than prior techniques, they can only handle very low-resolution inputs due to memory limitations and difficulty in training. Even for slightly larger images, the inpainted regions would appear blurry and unpleasant boundaries become visible. We propose a multi-scale neural patch synthesis approach based on joint optimization of image content and texture constraints, which not only preserves contextual structures but also produces high-frequency details by matching and adapting patches with the most similar mid-layer feature correlations of a deep classification network. We evaluate our method on the ImageNet and Paris Streetview datasets and achieved state-of-the-art inpainting accuracy. We show our approach produces sharper and more coherent results than prior methods, especially for high-resolution images.
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
(2000)

We study a class of circuit-switched wavelength-routing networks with fixed or alternate routing and with random wavelength allocation. We present an iterative path decomposition algorithm to evaluate accurately and efficiently the blocking performance of such networks with and without wavelength converters. Our iterative algorithm analyzes the original network by decomposing it into single-path subsystems. These subsystems are analyzed in isolation, and the individual results are appropriately combined to obtain a solution for the overall network. To analyze individual subsystems, we first construct an exact Markov process that captures the behavior of a path in terms of wavelength use. We also obtain an approximate Markov process which has a closed-form solution that can be computed efficiently for short paths. We then develop an iterative algorithm to analyze approximately arbitrarily long paths. The path decomposition approach naturally captures the correlation of both link loads and link blocking events. Our algorithm represents a simple and computationally efficient solution to the difficult problem of computing call-blocking probabilities in wavelength-routing networks. We also demonstrate how our analytical techniques can be applied to gain insight into the problem of converter placement in wavelength-routing networks.
A neuro-stimulus chip with telemetry unit for retinal prosthetic device
(2000)

In this retinal prosthesis project, a rehabilitative device is designed to replace the functionality of defective photoreceptors in patients suffering from retinitis pigmentosa (RP) and age-related macular degeneration (AMD). The device consists of an extraocular and an intraocular unit. The implantable component receives power and a data signal via a telemetric inductive link between the two units. The extraocular unit includes a video camera and video processing board, a telemetry protocol encoder chip, and an RF amplifier and primary coil. The intraocular unit consists of a secondary coil, a rectifier and regulator, a retinal chip with a telemetry protocol decoder, a stimulus signal generator, and an electrode array. This paper focuses on the design, fabrication, and testing of a microchip which serves as the telemetry protocol decoder and stimulus signal generator. It is fabricated by MOSIS with 1.2-mm CMOS technology and was demonstrated to provide the desired biphasic current stimulus pulses for an array of 100 retinal electrodes at video frame rates.
The Causal Foundations of Structural Equation Modeling
(2010)

The role of causality in SEM research is widely perceived to be, on the one hand, of pivotal methodological importance and, on the other hand, confusing, enigmatic and controversial. The confusion is vividly portrayed, for example, in the influential report of Wilkinson and Task Force’s (1999) on “Statistical Methods in Psychology Journals: Guidelines and Explanations.” In discussing SEM, the report starts with the usual warning: “It is sometimes thought that correlation does not prove causation but ‘causal modeling’ does. [Wrong! There are] dangers in this practice.” But then ends with a startling conclusion: “The use of complicated causal-modeling software [read SEM] rarely yields any results that have any interpretation as causal effects.” The implication being that the entire enterprise of causal modeling, from Sewell Wright (1921) to Blalock (1964) and Duncan (1975), the entire literature in econometric research, including modern advances in graphical and nonparametric structural models have all been misguided, for they have been chasing parameters that have no causal interpretation. The motives for such overstatements notwithstanding, readers may rightly ask: “If SEM methods do not ‘prove’ causation, how can they yield results that have causal interpretation?” Put another way, if the structural coefficients that SEM researchers labor to estimate can legitimately be interpreted as causal effects then, unless these parameters are grossly misestimated, why deny SEM researchers the honor of “establishing causation” or at least of deriving some useful claims about causation. The answer is that a huge logical gap exists between “establishing causation,” which requires careful manipulative experiments, and “interpreting parameters as causal effects,” which may be based on firm scientific knowledge or on previously conducted experiments, perhaps by other researchers. One can legitimately be in a possession of a parameter that stands for a causal effect and still be unable, using statistical means alone, to determine the magnitude of that parameter given non-experimental data. As a matter of fact, we know that
Librispeech: An ASR corpus based on public domain audio books
(2015)

This paper introduces a new corpus of read English speech, suitable for training and evaluating speech recognition systems. The LibriSpeech corpus is derived from audiobooks that are part of the LibriVox project, and contains 1000 hours of speech sampled at 16 kHz. We have made the corpus freely available for download, along with separately prepared language-model training data and pre-built language models. We show that acoustic models trained on LibriSpeech give lower error rate on the Wall Street Journal (WSJ) test sets than models trained on WSJ itself. We are also releasing Kaldi scripts that make it easy to build these systems.
Study about IOT's application in "Digital Agriculture" construction
(2011)

Along with acceleration of various countries' digitization and informationization, according to the 12th 5-year development plan, the internet of things (IOT) will become one of Chinese emerging strategic industries. Based on the analysis of IOT's basic concept and key technology, this paper studies IOT's application in "Digital Agriculture" construction. The main contents include: IOT's application in agricultural production, IOT's application in logistics and distribution of agricultural products, and IOT's application in agricultural products safety traceability.
A circle packing algorithm
(2003)

A circle packing is a configuration P of circles realizing a specified pattern of tangencies. Radii of packin the euclidean and hyperbolic planes may be computed using an iterative process suggested by William T We describe an efficient implementation, discuss its performance, and illustrate recent applications. A cen is played by new and subtle monotonicity results for “flowers” of circles.  2003 Elsevier Science B.V. All rights reserved.
Help from the Sky: Leveraging UAVs for Disaster Management
(2017)

This article presents a vision for future unmanned aerial vehicles (UAV)-assisted disaster management, considering the holistic functions of disaster prediction, assessment, and response. Here, UAVs not only survey the affected area but also assist in establishing vital wireless communication links between the survivors and nearest available cellular infrastructure. A perspective of different classes of geophysical, climate-induced, and meteorological disasters based on the extent of interaction between the UAV and terrestrially deployed wireless sensors is presented in this work, with suitable network architectures designed for each of these cases. The authors outline unique research challenges and possible solutions for maintaining connected aerial meshes for handoff between UAVs and for systems-specific, security- and energy-related issues. This article is part of a special issue on drones.
Cross-Level Sensor Network Simulation with COOJA
(2006)

Simulators for wireless sensor networks are a valuable tool for system development. However, current simulators can only simulate a single level of a system at once. This makes system development and evolution difficult since developers cannot use the same simulator for both high-level algorithm development and low-level development such as device-driver implementations. We propose cross-level simulation, a novel type of wireless sensor network simulation that enables holistic simultaneous simulation at different levels. We present an implementation of such a simulator, COOJA, a simulator for the Contiki sensor node operating system. COOJA allows for simultaneous simulation at the network level, the operating system level, and the machine code instruction set level. With COOJA, we show the feasibility of the cross-level simulation approach
Design considerations and performance evaluation of 1200 V, 100 a SiC MOSFET based converter for high power density application
(2013)

Silicon Carbide (SiC) MOSFET is capable of achieving better efficiency, power density and reliability of power converters due to its low on-state resistance, high temperature operation capability and lower switching losses compared to silicon (Si) IGBT. Operation of power converters at higher switching frequency using SiC devices allows reduction in filter size and hence improves the power to weight ratio of the converter. This paper presents switching characterization of 1200 V, 100 A SiC MOSFET module and compares efficiency of a Two Level Voltage Source Converter (2L-VSC) using SiC MOSFETs and Si IGBTs. Also, various design considerations of the 1200 V, 100 A SiC MOSFET based 2L-VSC including gate drive design, bus bar packaging and thermal management have been elaborated. The designed and developed 2L-VSC is operated to supply 35 kVA load at 20 kHz switching frequency with DC bus voltage at 800 V and the experimental results are presented.
A Reconfigurable Fabric for Accelerating Large-Scale Datacenter Services
(2014)

Datacenter workloads demand high computational capabilities, flexibility, power efficiency, and low cost. It is challenging to improve all of these factors simultaneously. To advance datacenter capabilities beyond what commodity server designs can provide, we designed and built a composable, reconfigurable hardware fabric based on field programmable gate arrays (FPGA). Each server in the fabric contains one FPGA, and all FPGAs within a 48-server rack are interconnected over a low-latency, high-bandwidth network.
 We describe a medium-scale deployment of this fabric on a bed of 1632 servers, and measure its effectiveness in accelerating the ranking component of the Bing web search engine. We describe the requirements and architecture of the system, detail the critical engineering challenges and solutions needed to make the system robust in the presence of failures, and measure the performance, power, and resilience of the system. Under high load, the large-scale reconfigurable fabric improves the ranking throughput of each server by 95% at a desirable latency distribution or reduces tail latency by 29% at a fixed throughput. In other words, the reconfigurable fabric enables the same throughput using only half the number of servers.
Work Related Stress, Burnout, Job Satisfaction and General Health of Nurses
(2015)

Gaps in research focusing on work related stress, burnout, job satisfaction and general health of nurses is evident within developing contexts like South Africa. This study identified the relationship between work related stress, burnout, job satisfaction and general health of nurses. A total of 1200 nurses from four hospitals were invited to participate in this cross-sectional study (75% response rate). Participants completed five questionnaires and multiple linear regression analysis was used to determine significant relationships between variables. Staff issues are best associated with burnout as well as job satisfaction. Burnout explained the highest amount of variance in mental health of nurses. These are known to compromise productivity and performance, as well as affect the quality of patient care. Issues, such as security risks in the workplace, affect job satisfaction and health of nurses. Although this is more salient to developing contexts it is important in developing strategies and intervention programs towards improving nurse and patient related outcomes.
Performance of PMASynRM With Ferrite Magnets for EV/HEV Applications Considering Productivity
(2014)

Although motors that use rare-earth permanent magnets typically exhibit high performance, their cost is high, and there are concerns about the stability of the raw material supply. This paper proposes a permanent-magnet-assisted synchronous reluctance motor (PMASynRM) with a ferrite magnet that does not use rare-earth materials considering productivity. The performance of the proposed PMASynRM is evaluated based on the finite-element method and an experiment using a prototype machine. The analysis results reveal that the proposed PMASynRM has the same power density and an equivalent efficiency as rare-earth permanent-magnet synchronous motors for hybrid electric vehicles (2003 Toyota Prius). Furthermore, some experimental results are presented in order to validate the analytical results. As a result, the proposed PMASynRM was found to achieve high-power-density and high-efficiency performance.
Adaptive Speculative Processing of Out-of-Order Event Streams
(2014)

Distributed event-based systems are used to detect meaningful events with low latency in high data-rate event streams that occur in surveillance, sports, finances, etc. However, both known approaches to dealing with the predominant out-of-order event arrival at the distributed detectors have their shortcomings: buffering approaches introduce latencies for event ordering, and stream revision approaches may result in system overloads due to unbounded retraction cascades.
 This article presents an adaptive speculative processing technique for out-of-order event streams that enhances typical buffering approaches. In contrast to other stream revision approaches developed so far, our novel technique encapsulates the event detector, uses the buffering technique to delay events but also speculatively processes a portion of it, and adapts the degree of speculation at runtime to fit the available system resources so that detection latency becomes minimal.
 Our technique outperforms known approaches on both synthetical data and real sensor data from a realtime locating system (RTLS) with several thousands of out-of-order sensor events per second. Speculative buffering exploits system resources and reduces latency by 40% on average.
Cerebellar ataxia rehabilitation trial in degenerative cerebellar diseases.
(2012)

OBJECTIVE
To investigate short- and long-term effects of intensive rehabilitation on ataxia, gait, and activities of daily living (ADLs) in patients with degenerative cerebellar disease.


METHODS
A total of 42 patients with pure cerebellar degeneration were randomly assigned to the immediate group or the delayed-entry control group. The immediate group received 2 hours of inpatient physical and occupational therapy, focusing on coordination, balance, and ADLs, on weekdays and 1 hour on weekends for 4 weeks. The control group received the same intervention after a 4-week delay. Short-term outcome was compared between the immediate and control groups. Long-term evaluation was done in both groups at 4, 12, and 24 weeks after the intervention. Outcome measures included the assessment and rating of ataxia, Functional Independence Measure, gait speed, cadence, functional ambulation category, and number of falls.


RESULTS
The immediate group showed significantly greater functional gains in ataxia, gait speed, and ADLs than the control group. Improvement of truncal ataxia was more prominent than limb ataxia. The gains in ataxia and gait were sustained at 12 weeks and 24 weeks, respectively. At least 1 measure was better than at baseline at 24 weeks in 22 patients.


CONCLUSIONS
Short-term benefit of intensive rehabilitation was evident in patients with degenerative cerebellar diseases. Although functional status tended to decline to the baseline level within 24 weeks, gains were maintained in more than half of the participants.
Interoperability evaluation models: A systematic review
(2014)

Interoperability is defined as the ability for two (or more) systems or components to exchange information and to use the information that has been exchanged. There is increasing demand for interoperability between individual software systems. Developing an interoperability evaluation model between software and information systems is difficult, and becoming an important challenge. An interoperability evaluation model allows knowing the degree of interoperability, and lead to the improvement of interoperability. This paper describes the existing interoperability evaluation models, and performs a comparative analysis among their findings to determine the similarities and differences in their philosophy and implementation. This analysis yields a set of recommendations for any party that is open to the idea of creating or improving an interoperability evaluation model. 2013 Elsevier B.V. All rights reserved.
The partograph for the prevention of obstructed labor.
(2009)

Obstructed labor is an important cause of maternal and perinatal mortality and morbidity. The partograph graphically represents key events in labor and provides an early warning system. The World Health Organization partographs are the best known partographs in low resource settings. Experiences with World Health Organization and other types of partographs in low resource settings suggest that when used with defined management protocols, this inexpensive tool can effectively monitor labor and prevent obstructed labor. However, challenges to implementation exist and these should be addressed urgently.
Divertible Protocols and Atomic Proxy Cryptography
(1998)

First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). We give a definition of protocol divertibility that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta’s definition in the case of interactive zero-knowledge proofs. Other important examples falling under the new definition are blind signature protocols. We propose a sufficiency criterion for divertibility that is satisfied by many existing protocols and which, surprisingly, generalizes to cover several protocols not normally associated with divertibility (e.g., Diffie-Hellman key exchange). Next, we introduce atomic proxy cryptography, in which an atomic proxy function, in conjunction with a public proxy key, converts ciphertexts (messages or signatures) for one key into ciphertexts for another. Proxy keys, once generated, may be made public and proxy functions applied in untrusted environments. We present atomic proxy functions for discrete-log-based encryption, identification, and signature schemes. It is not clear whether atomic proxy functions exist in general for all public-key cryptosystems. Finally, we discuss the relationship between divertibility and proxy cryptography.
Proxy Cryptography Revisited
(2003)

In this work we revisit and formally study the notion of proxy cryptography. Intuitively, various proxy functions allow two cooperating parties F (the “FBI”) and P (the “proxy”) to duplicate the functionality available to t he third party U (the “user”), without being able to perform this functionality on their own (without cooperation). The concept is closely related to the notion of threshold cryptography, except we deal with only two parties P andF , and place very strict restrictions on the way the operations are performed (which is done for the sake of efficiency, usability and scalability). For example, for decryption (res p. signature)P (F ) sends a single message to F (P ), after which the latter can decrypt (sign) the message. Our formal modeling of proxy cryptography significantly generalizes, simplifies and simultaneously clarifies the model of “atomic proxy” suggested by Blaze and Strauss [4]. In particular, we define bidirectional and unidirectional var iants of our model 1, and show extremely simple generic solutions for proxy signature and encryption in these models. We also give more efficient solutions for several specific schemes. We conclude that proxy cryptography is a relatively simple concept to satisfy when looked from the correct and formal standpoint.
A Hard-Core Predicate for all One-Way Functions
(1989)

A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core” predicates <italic>b</italic> of functions (permutations) ƒ, discovered in [Blum Micali 82]. Such <italic>b</italic>(<italic>x</italic>) cannot be efficiently guessed (substantially better than 50-50) given only ƒ(<italic>x</italic>). Both <italic>b</italic>, ƒ are computable in polynomial time.
[Yao 82] transforms any one-way function ƒ into a more complicated one, ƒ<supscrpt>*</supscrpt>, which has a hard-core predicate. The construction applies the original ƒ to many small pieces of the input to ƒ<supscrpt>*</supscrpt> just to get one “hard-core” bit. The security of this bit may be smaller than any constant positive power of the security of ƒ. In fact, for inputs (to ƒ<supscrpt>*</supscrpt>) of practical size, the pieces effected by ƒ are so small that ƒ can be inverted (and the “hard-core” bit computed) by exhaustive search.
In this paper we show that every one-way function, padded to the form ƒ(<italic>p</italic>, <italic>x</italic>) = (<italic>p</italic>, <italic>g</italic>(<italic>x</italic>)), ‖‖<italic>p</italic>‖‖ = ‖<italic>x</italic>‖, has by itself a hard-core predicate of the same (within a polynomial) security. Namely, we prove a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors <italic>p</italic>, <italic>x</italic> is a hard-core of every one-way function ƒ(<italic>p</italic>, <italic>x</italic>) = (<italic>p</italic>, <italic>g</italic>(<italic>x</italic>)). The result extends to multiple (up to the logarithm of security) such bits and to any distribution on the <italic>x</italic>'s for which ƒ is hard to invert.
Zero-knowledge proofs of identity
(1987)

In this paper we extend the notion of zero knowledge proofs of membership (which reveal one bit of information) to zero knowledge proofs of knowledge (which reveal no information whatsoever). After formally defining this notion, we show its relevance to identification schemes, in which parties prove their identity by demonstrating their knowledge rather than by proving the validity of assertions. We describe a novel scheme which is provably secure if factoring is difficult and whose practical implementations are about two orders of magnitude faster than RSA-based identification schemes. In the last part of the paper we consider the question of sequential versus parallel executions of zero knowledge protocols, define a new notion of “transferable information”, and prove that the parallel version of our identification scheme (which is not known to be zero knowledge) is secure since it reveals no transferable information.