The focus of CERES is on enabling technologies for co-operating embedded systems and high performance applications [ 1 ] . The people involved in CERES have a rather broad background spanning complex computer architecture , computer science , data communication , telecommunication , mechatronics , signal processing , and digital hardware design . If a closer look is taken on what the theme cooperating embedded systems means , it becomes obvious that this broad competence spectrum is a good match to the kind of competence that is needed for successfully dealing with research in the area of co-operating embedded systems . By following Zhang et al. 's design method , a special class of recurrent neural network termed Zhang neural network ( ZNN ) has been proposed for online solution of time-varying linear inequalities . For the purpose of digital-hardware implementation , the resultant ZNN model is discretized by employing Euler difference rule in this paper . Thus , three discrete-time ZNN models and numerical algorithms ( i.e. , discrete-time ZNN algorithms , in short ) are proposed and investigated for online solution of time-varying linear matrix-vector inequalities . Extracting the fixed point model for digital hardware implementation is an important step in the realization of digital signal processing systems . In such a model , limited word lengths for processing blocks should be selected with no harmful effects on the system performance . A new behavioral model is proposed which can provide similar accuracy to the memory polynomial model ( MPM ) but is shown to have a more efficient architecture for digital hardware implementation . These features have been achieved by the proposed formulation , in which the nonlinear weights of the memory terms are a function of only the present input sample . Refactoring is the concept of restructuring software to increase its readability and maintainability without changing the observable behavior : To the best of our knowledge , the concept of refactoring has only been applied to software development . In this paper , we describe a methodology to extend this concept into the Digital Hardware Design process using the Open Verification Library . We present a case of a network protocol bus functional model in which we want to increase the design readability so that maintenance and bug fixes are less costly . Designing hardware using High Level Synthesis automates parts of the digital hardware design process . By automating the process control is passed from the designer to the tool , thus it is highly important that the tool generates high performance hardware in terms of area and speed . The computer software profession has begun to realize the vital need for systematic approaches to problem solving . We hope to contribute to a similar movement in the digital hardware design area . On top of that , the algorithms that they implement are getting even more sophisticated , advanced and demanding . To cope with all these diverse requirements , control system designers are moving with fast steps to the digital hardware design field and specifically , FPGAs , System-on-Chip architectures and productivity improving methodologies like High-Level Synthesis , which uses C/C++ as an abstract hardware description language . In this paper , using these tools , the implementation of 3 control algorithms is shown , the classical PID algorithm , a Fuzzy Logic Controller ( FLC ) and an Adaptive or Tuning Fuzzy Logic Controller ( TFLC ) . Hardware description languages ( HDL ) such as VHDL are today an essential technology to support most of the steps of digital hardware design , such as simulation , synthesis , testing , and formal proof . As the IEEE 1076 standard , VHDL is committed to evolve through five years re-standardization cycles whose objective is to make the necessary language changes or extensions in response to feedbacks from users and from tool suppliers . We do this using a novel embedded domain-specific language approach that exploits the capabilities of full-spectrum dependent types . Our approach provides significant benefits over previous approaches based on less powerful type systems in reducing notational overhead , and in simplifying the process of formal proof . 1 . Formal proof : proof as a theoretical concept in formal logic ( or metalogic ) , which may be thought of as the ideal which actual mathematical practice only approximates . 2 . Conducting formal proofs can be tedious and error prone when done manually , but can also be very useful in terms certainty and gaining a more intuitive understanding of the problems . This thesis focuses on the development of a tool for formal proof checking of small concurrent programs . The tool was developed using the functional programming language Agda . We present a novel propositional proof tracing format that eliminates complex processing , thus enabling efficient ( formal ) proof checking . The benefits of this format are demonstrated by implementing a proof checker in C , which outperforms a state-of-the-art checker by two orders of magnitude . Among the most studied properties of fuzzy implication functions , the so-called contrapositive symmetry or law of contraposition with respect to a fuzzy negation is of special interest because it is a key property in approximate reasoning , deductive systems and formal methods of proof . Even when contraposition is not satisfied , there exist some methods for modifying an implication function with the aim that the new implication satisfies this property , these methods are known as contrapositivisations . Set within an educational design research approach and building on cognitive apprenticeship and socio cultures cognition theories , we have collected empirical , mainly qualitative observational data focusing on students ' activities with Coq in an introductory course specifically created for that matter . Our results strengthen the assumption that a theorem prover like Coq , indeed , can be beneficial in mediating undergraduate students ' activities in learning formal proofing . In comparison to pen & paper proofs , students were profiting strongly from the system 's immediate feedback and scaffolding . SS contains no proof that English is beyond the power of finite state description ( it is not clear that Chomsky ever gave a sound mathematical argument for that claim ) . The approach advocated by SS springs directly out of the work of the mathematical logician Emil Post on formalizing proof , but few linguists are aware of this , because Post ’s papers are not cited . Chomsky ’s extensions to Post ’s systems are not clearly defined , and the arguments for their necessity are weak . Predicting parts of the programs that are more defects prone could ease up the software testing process , which leads to testing cost and testing time reduction . Fault prediction models use software metrics and defect data of earlier or similar versions of the project in order to improve software quality and exploit available resources . In the Collaborative Requirements Capture Tool ( CORECT ) project , we are building a computer based requirements capture tool for custom built electronic testing systems . The requirements capture process involves the participation of a wide range of different types of people — the customer , the salesperson , systems engineers , quality assurance , marketing and so on . The goal of software testing analysis is to validate that an implementation satisfies its specifications . Many errors in software are caused by generalizable flaws in the source code . It is important to find out if a mutant is equivalent . In this paper , we have proposed a Fuzzy model for weak and strong mutation testing to find out whether a mutant is equivalent or not . Testing is the process of stimulating a system with inputs in order to reveal hidden parts of the system state . We consider a variant of the constraint-based testing problem that was put forward in the model-based diagnosis literature , and consists of finding input patterns that can discriminate between different , possibly non-deterministic models . We show that this problem can be framed as a game played between two opponents , and naturally lends itself towards a formulation in terms of quantified CSPs . Running Linux with Broken Memory . Nondestructive object testing is carried out in a magnetic aspect as by leakage-flux detection and in an ultrasonic aspect by electromagnetic acoustic wave generation and detection , portions of magnetic flux being derived from a common source for the respective magnetic and ultrasonic testing . An automotive company 's goal is to design and manufacture vehicles that meet the needs and expectations of its customers . Laboratory ( lab ) testing is a critical step in developing vehicle components or systems . It allows the design engineer to evaluate the design early in the product development process . In this paper , basic system action testing of a system was put into effect . An air-conditioning equipment was used for system action testing . As a result , the cooperativeness of DC power supply system and AC power supply system were confirmed . Findings – The major finding is that robust Bayesian audit strategies that have recently been developed in auditing research are more sensitive to non‐sampling errors than existing strategies of audit practice . Practical implications – The authors find that there are differential effects of sampling error vs non‐sampling error on the Bayesian strategies and that controls testing does not need to be extensive to get full internal contro ... The utility model is characterized in that the testing device also comprises a magnetic powder brake ; a torque and rotating speed sensor , a flywheel and a DC generator are positioned on a mounting flat plate and are connected with the magnetic powder brake in sequence through a coupling ; the other end of the torque and rotating speed sensor serves as the connecting end of the axle-stretch end of a motor upon testing ; the DC excitation port of the magnetic powder brake is connected with a controllable DC power supply in a permanent magnet motor comprehensive testing control cabinet ; a photoelectric encoder is arranged on a fan end of the motor upon testing . The microcomputer comprehensive testing device for an automatic-start rare earth permanent magnet motor can achieve the function of completing the static and dynamic torque testing on the same testing device , so as to save the ex-factory testing time of each motor . Our solution to the feature pyramid in CNN descends from the observations of modern CNN - based detectors , including Faster - RCNN , R - FCN , SSD , YOLO and STN , where feature maps are first computed and the detection results are decoded from the maps afterwards . However , the computation cost of generating feature maps becomes a bottleneck for methods using multi - scale testing and it seems not to be a neat solution to the scale variation problem . To this end , our philosophy of designing an elegant detection system is that we calculate the feature pyramid once only , and only through that pyramid can we approximate the rest feature pyramids at other scales . We utilize multi - scale training where the input image is resized with bilinear interpolation to various scales ( say , 1024 or 1200 ) . In the testing stage , multi - scale testing is performed by scale image into an image pyramid for better detecting on both tiny and general faces . subsection : Comparison on Benchmarks It is anticipated that use of this type of speech prosthesis will be more difficult to learn than the use of conventional communication aids , but the flexibility of this approach will be much greater . The difficulty in this approach arises because the complexity of the human interface must be limited while sufficient information must be obtained to permit synthesis of speech sounds at conversational rates . A prototype has been constructed , and experimentation and further development are discussed.<<ETX > > The processing of speech involves the analysis , coding , decoding , and synthesis of speech sounds . The speech analyzer consists of normalizers , syllable and syblet segmenters , sound recognizers , sequencers , adapters , and memories which convert the speech elements into a code . The design procedure for higher order group delay filters as a cascade of second order filters is first described . These higher order filters enable the synthesis of speech sounds by simultaneously varying the height and bandwidth of the group delay spectrum . The group delay filter response is corrected by removing zeros in close proximity to the unit circle which give rise to abrupt phase transitions at points of significant excitation . Nonlinear interactions may impose several restrictions to numerical simulation attempts , in particular concerning the design of unconditionally stable algorithms . Such algorithms are required for real-time synthesis applications where virtual instruments may be modified on-line . One characteristic case of nonlinear interactions is that of impact sounds . This paper gives a brief summary of recently developed numerical techniques that are suitable for the simulation of systems involving collisions . A simple numerical example , involving a lumped collision model , is used to demonstrate the methodology , and further perspectives concerning the applicability of the presented family of schemes to real-time synthesis applications are discussed . Analysis on numerical simulations shows that the system behaves qualitatively as higher-dimensional models ( such as the two-mass model by Ishizaka and Flanagan ) ; in particular , control over flow skewness is guaranteed , allowing for synthesis of realistic glottal flow waveforms . As only one degree of freedom ( one mass ) is needed in the model , structure and number of parameters are drastically reduced , thus making it suitable for real-time synthesis applications . In this work we address the problem of multiple-level Boolean logic networks synthesis using genetics algorithms , aimed at achieving area-efficient implementation . The initial population is based on all kernels of the network . NFG Optimum Control Synthesis via Switched Fuzzy Time-Delay Systems . A solution to the design of intelligent , optimum guaranteed-cost and robust , control for a class of uncertain switched nonlinear systems via switched fuzzy models possessing time delays and uncertainties has been developed . The esters synthesis dynamics was similar for the free and the immobilized cell which was confirmed by the kinetic model . The dynamics of the higher alcohol synthesis was comparable for the free and immobilized cell , but there were some differences . The dynamics of the higher alcohols accumulation for the free and immobilized cells was similar , but there were some differences between the two used strains . In this paper we propose a method of synthesizing statecharts from multiple scenarios , with respect to the relationships among them . We describe a set of rules for the synthesis of statecharts from multiple scenarios , as a means to properly describe the requirements speci£cations of a system . By comparison , computationally driven materials synthesis screening is still in its infancy , and is mired by the challenges of data sparsity and data scarcity : Synthesis routes exist in a sparse , high-dimensional parameter space that is difficult to optimize over directly , and , for some materials of interest , only scarce volumes of literature-reported syntheses are available . In this article , we present a framework for suggesting quantitative synthesis parameters and potential driving factors for synthesis outcomes . We use a variational autoencoder to compress sparse synthesis representations into a lower dimensional space , which is found to improve the performance of machine-learning tasks . In this paper , we propose a technique to synthesize a cost-efficient distributed platform consisting of multiple Application Specific Instruction Set Processors ( multi-ASIPs ) running applications with strict timing constraints . Multi-ASIP platform synthesis is a non-trivial task for two reasons . Firstly , we need to know the WCET of tasks in target applications to derive platforms ( including synthesized ASIPs ) in which the tasks are schedulable . The report substantiates the concept of the analytic spectrum and the synthesis of time-frequency representations of signals based on it . A number of properties of the analytic spectrum are considered and their comparison with the corresponding properties of the analytic signal is carried out . A particularly important aspect for extending existing methods to address composite systems is the ability , given programs that realise component specifications , to synthesise the interconnections between them in such a way that the system specification is realised . Taking our cue from earlier work on General Systems Theory ( Goguen , 1973 ) and more recent work on parallel program design ( Fiadeiro and Maibaum , 1996 ) , we discuss , characterise and provide solutions for the synthesis of interconnections using a categorical framework in which components are modelled as objects ( either specifications or programs ) and morphisms are used to express interconnections between components . We then jointly fine - tune all the networks together . We use this generator design to effectively aggregate global and local information for the image synthesis task . We note that such a multi - resolution pipeline is a well - established practice in computer vision and two - scale is often enough . Recently , several works learn to produce a fixed number of discrete outputs given the same input or synthesize diverse modes controlled by a latent code that encodes the entire image . Although these approaches tackle the multi - modal image synthesis problem , they are unsuitable for our image manipulation task mainly for two reasons . First , the user has no intuitive control over which kinds of images the model would produce . To generate diverse images and allow instance - level control , we propose adding additional low - dimensional feature channels as the input to the generator network . We show that , by manipulating these features , we can have flexible control over the image synthesis process . Furthermore , note that since the feature channels are continuous quantities , our model is , in principle , capable of generating infinitely many images . This mode seeking regularization term is readily applicable to various conditional generation tasks without imposing training overhead or modifying the original network structures . We validate the proposed algorithm on three conditional image synthesis tasks including categorical generation , image - to - image translation , and text - to - image synthesis with different baseline models . Both qualitative and quantitative results demonstrate the effectiveness of the proposed regularization method for improving diversity without loss of quality . subsection : Conditioned on Text Text - to - image synthesis targets at generating images conditioned on text descriptions . We integrate the proposed regularization term on StackGAN ++ using the CUB - 200 - 2011 dataset . Figure . [ reference ] shows the interpolation results on the dog - to - cat translation and the text - to - image synthesis task . In the dog - to - cat translation , we can see the coat colors and patterns varies smoothly along with the latent vectors . This inability to easily search and organize the published literature impedes the aims of evidence based medicine ( EBM ) , which aspires to inform patient care using the totality of relevant evidence . Computational methods could expedite biomedical evidence synthesis and natural language processing ( NLP ) in particular can play a key role in the task . Prior work has explored the use of NLP methods to automate biomedical evidence extraction and synthesis . Concatenative synthesis with unit selection , the process of stitching small units of pre - recorded waveforms together was the state - of - the - art for many years . Statistical parametric speech synthesis , which directly generates smooth trajectories of speech features to be synthesized by a vocoder , followed , solving many of the issues that concatenative synthesis had with boundary artifacts . However , the audio produced by these systems often sounds muffled and unnatural compared to human speech . A comprehensive approach to the real-time simulation of power converters using a state-space representation is covered in this paper . Systematic formulations of state-space equations as well as a new switch model are presented . The proposed switch model exhibits a natural switching behavior , which is a valuable characteristic for the real-time simulation of power converters , thereby allowing individual treatment of switching devices irrespective of the converter topology . Successful implementations of the proposed switch model on a field programmable gate array ( FPGA ) device are reported , with two alternative approaches : 1 ) precomputing network equations for all switch state combinations and 2 ) solving network equations on-chip using the Gauss-Seidel iterative method . In this paper , an indirect matrix converter ( IMC ) which makes directly ac-ac power conversion , is modeled and simulated in real-time to demonstrate the capability of the new link between Opal-RT 's eHS ( electric Hardware Solver ) and the CAD tool PSIM . An automatic methodology for the real-time simulation of power converters from PSIM circuit designs to FPGA is presented and discussed . A time-step of 250 ns is achieved on an FPGA computing engine developing up to 25.6 GFLOPS of processing power . This paper deals with simulation of plant development and focuses on influence of light . Most of the previously published methods dealing with light in these simulations use sky discretization , source of aliasing error which was never mentioned in literature . L-systems are parallel grammars that provide a theoretical foundation for a class of programs used in the simulation of plant development and procedural image synthesis . In particular , the formalism of L-systems guides the construction of declarative languages for specifying input to these programs . Data acquisition interface is a necessary system in a Flight Simulation Device . Its action is to complete the series or parallel commucation between the master computer and other systems , send some of important information in data form to display devices . In this paper the design of a bimanual haptic interface device for simulation of minimally invasive surgical procedures is described . Each of the two handles has five haptic degrees of freedom . The paper advanced a novel modified discrete chirp-Fourier transform ( MDCFT ) to overcome the restriction , this new transform can make the signal energy concentrate in the transform domain to precisely estimate the parameters . The simulation SAR imaging based on the MDCFT proves that the new algorithm is more practical and effective . A Grand Challenge . The future of air transportation modeling and simulation represents a grand challenge for both the air transportation and the modeling and simulation communities . In addition to its size and scope , air transportation has many technical , operational , organizational , policy , security and legal aspects contributing to its complexity , yet must ensure an un-rivaled level of safety throughout any transition to next generation systems . Currently , in many engineering areas , including civil engineering , there are increasing demands for various modelling and simulation services that would be accessible over the Web . The basis for such solutions could be existing legacy applications with proven properties , such as numerical stability of the used algorithms . parallel and distributed discrete event simulation distributed discrete-event simulation ece/cis parallel discrete event simulation with erlang1 arxiv parallel and distributed discrete event simulation parallel/distributed discrete event simulation execution parallel discrete event simulation : a shared memory approach ieee transactions on parallel and distributed systems 1 parallel discrete event simulation with anylogic distributed and parallel demand driven logic simulation a new mathematical model for optimizing the performance of parallel and distributed vhdl simulation cecs μsik – a micro-kernel for parallel/distributed simulation parallel discrete event simulation techniques for exploiting temporal uncertainty in parallel and parallel discrete-event simulation researchgate distribution of parallel discrete-event simulations in ges 10 case study ii : parallel discrete-event simulation performance factors in parallel discrete event simulation parallel/distributed simulation via eventreservation a simulation approach to facilitate parallel and parallel and distributed simulation ieee computer society μsik – a micro-kernel for parallel/distributed simulation chapter 13 towards flexible , reliable , high throughput 1999 : parallel and distributed simulation parallel discrete-event simulation tool for population 2001 : parallel and distributed simulation systems simulation modelling practice and theory semantic scholar distributed simulation of large computer systems parallel discrete-event simulation of population dynamics discrete event simulation tu wien parallel discrete event simulation using shared memory conservative distributed discrete event simulation on parallel simulation made easy with omnet++ composite synchronization in parallel discrete-event master/worker parallel discrete event simulation μsik – a micro-kernel for parallel/distributed simulation parallel and distributed spatial simulation of chemical variance reduction algorithms for parallel replicated lookahead accumulation in conservative parallel discrete distributed simulation with ns3 advances in parallel discrete event simulation for 4 , 397 asynchronous parallel discrete event sirnullation pdes-a : a parallel discrete event simulation accelerator jwarp : a java library for parallel discrete-event simulations scalable and flexible parallel/distributed simulation accelerating traffic microsimulations : a parallel discrete parallel and distributed discrete event simulation The authors present the design and implementation of an airport simulator based on the entity-life model . The concurrency features of Ada , combined with the design principles of the entity-life model , are shown to be very appropriate to the airport simulation problem , which is inherently concurrent . The tasks resulting from the design based on the entity-life model were mostly isomorphic to the real-world entities they represent and thus helped make the design simpler in addition to capturing real-world concurrency which is so vital to many applications . Given such a formal specification of system V&V ( Verification and Validation ) cases , dedicated co-simulation services will be developed to provide the support for automated configuration and execution of simulation tools . For quality management , the co-simulation services themselves will be specified and managed by models in SysML .
The focus of CERES is on enabling technologies for co-operating embedded systems and high performance applications [ 1 ] . The people involved in CERES have a rather broad background spanning complex computer architecture , computer science , data communication , telecommunication , mechatronics , signal processing , and digital hardware design . If a closer look is taken on what the theme cooperating embedded systems means , it becomes obvious that this broad competence spectrum is a good match to the kind of competence that is needed for successfully dealing with research in the area of co-operating embedded systems .
By following Zhang et al. 's design method , a special class of recurrent neural network termed Zhang neural network ( ZNN ) has been proposed for online solution of time-varying linear inequalities . For the purpose of digital-hardware implementation , the resultant ZNN model is discretized by employing Euler difference rule in this paper . Thus , three discrete-time ZNN models and numerical algorithms ( i.e. , discrete-time ZNN algorithms , in short ) are proposed and investigated for online solution of time-varying linear matrix-vector inequalities .
Extracting the fixed point model for digital hardware implementation is an important step in the realization of digital signal processing systems . In such a model , limited word lengths for processing blocks should be selected with no harmful effects on the system performance .
A new behavioral model is proposed which can provide similar accuracy to the memory polynomial model ( MPM ) but is shown to have a more efficient architecture for digital hardware implementation . These features have been achieved by the proposed formulation , in which the nonlinear weights of the memory terms are a function of only the present input sample .
Refactoring is the concept of restructuring software to increase its readability and maintainability without changing the observable behavior : To the best of our knowledge , the concept of refactoring has only been applied to software development . In this paper , we describe a methodology to extend this concept into the Digital Hardware Design process using the Open Verification Library . We present a case of a network protocol bus functional model in which we want to increase the design readability so that maintenance and bug fixes are less costly .
Designing hardware using High Level Synthesis automates parts of the digital hardware design process . By automating the process control is passed from the designer to the tool , thus it is highly important that the tool generates high performance hardware in terms of area and speed .
The computer software profession has begun to realize the vital need for systematic approaches to problem solving . We hope to contribute to a similar movement in the digital hardware design area .
On top of that , the algorithms that they implement are getting even more sophisticated , advanced and demanding . To cope with all these diverse requirements , control system designers are moving with fast steps to the digital hardware design field and specifically , FPGAs , System-on-Chip architectures and productivity improving methodologies like High-Level Synthesis , which uses C/C++ as an abstract hardware description language . In this paper , using these tools , the implementation of 3 control algorithms is shown , the classical PID algorithm , a Fuzzy Logic Controller ( FLC ) and an Adaptive or Tuning Fuzzy Logic Controller ( TFLC ) .
Hardware description languages ( HDL ) such as VHDL are today an essential technology to support most of the steps of digital hardware design , such as simulation , synthesis , testing , and formal proof . As the IEEE 1076 standard , VHDL is committed to evolve through five years re-standardization cycles whose objective is to make the necessary language changes or extensions in response to feedbacks from users and from tool suppliers .
We do this using a novel embedded domain-specific language approach that exploits the capabilities of full-spectrum dependent types . Our approach provides significant benefits over previous approaches based on less powerful type systems in reducing notational overhead , and in simplifying the process of formal proof .
1 . Formal proof : proof as a theoretical concept in formal logic ( or metalogic ) , which may be thought of as the ideal which actual mathematical practice only approximates . 2 .
Conducting formal proofs can be tedious and error prone when done manually , but can also be very useful in terms certainty and gaining a more intuitive understanding of the problems . This thesis focuses on the development of a tool for formal proof checking of small concurrent programs . The tool was developed using the functional programming language Agda .
We present a novel propositional proof tracing format that eliminates complex processing , thus enabling efficient ( formal ) proof checking . The benefits of this format are demonstrated by implementing a proof checker in C , which outperforms a state-of-the-art checker by two orders of magnitude .
Among the most studied properties of fuzzy implication functions , the so-called contrapositive symmetry or law of contraposition with respect to a fuzzy negation is of special interest because it is a key property in approximate reasoning , deductive systems and formal methods of proof . Even when contraposition is not satisfied , there exist some methods for modifying an implication function with the aim that the new implication satisfies this property , these methods are known as contrapositivisations .
Set within an educational design research approach and building on cognitive apprenticeship and socio cultures cognition theories , we have collected empirical , mainly qualitative observational data focusing on students ' activities with Coq in an introductory course specifically created for that matter . Our results strengthen the assumption that a theorem prover like Coq , indeed , can be beneficial in mediating undergraduate students ' activities in learning formal proofing . In comparison to pen & paper proofs , students were profiting strongly from the system 's immediate feedback and scaffolding .
SS contains no proof that English is beyond the power of finite state description ( it is not clear that Chomsky ever gave a sound mathematical argument for that claim ) . The approach advocated by SS springs directly out of the work of the mathematical logician Emil Post on formalizing proof , but few linguists are aware of this , because Post ’s papers are not cited . Chomsky ’s extensions to Post ’s systems are not clearly defined , and the arguments for their necessity are weak .
Predicting parts of the programs that are more defects prone could ease up the software testing process , which leads to testing cost and testing time reduction . Fault prediction models use software metrics and defect data of earlier or similar versions of the project in order to improve software quality and exploit available resources .
In the Collaborative Requirements Capture Tool ( CORECT ) project , we are building a computer based requirements capture tool for custom built electronic testing systems . The requirements capture process involves the participation of a wide range of different types of people — the customer , the salesperson , systems engineers , quality assurance , marketing and so on .
The goal of software testing analysis is to validate that an implementation satisfies its specifications . Many errors in software are caused by generalizable flaws in the source code .
It is important to find out if a mutant is equivalent . In this paper , we have proposed a Fuzzy model for weak and strong mutation testing to find out whether a mutant is equivalent or not .
Testing is the process of stimulating a system with inputs in order to reveal hidden parts of the system state . We consider a variant of the constraint-based testing problem that was put forward in the model-based diagnosis literature , and consists of finding input patterns that can discriminate between different , possibly non-deterministic models . We show that this problem can be framed as a game played between two opponents , and naturally lends itself towards a formulation in terms of quantified CSPs .
Running Linux with Broken Memory . Nondestructive object testing is carried out in a magnetic aspect as by leakage-flux detection and in an ultrasonic aspect by electromagnetic acoustic wave generation and detection , portions of magnetic flux being derived from a common source for the respective magnetic and ultrasonic testing .
An automotive company 's goal is to design and manufacture vehicles that meet the needs and expectations of its customers . Laboratory ( lab ) testing is a critical step in developing vehicle components or systems . It allows the design engineer to evaluate the design early in the product development process .
In this paper , basic system action testing of a system was put into effect . An air-conditioning equipment was used for system action testing . As a result , the cooperativeness of DC power supply system and AC power supply system were confirmed .
Findings – The major finding is that robust Bayesian audit strategies that have recently been developed in auditing research are more sensitive to non‐sampling errors than existing strategies of audit practice . Practical implications – The authors find that there are differential effects of sampling error vs non‐sampling error on the Bayesian strategies and that controls testing does not need to be extensive to get full internal contro ...
The utility model is characterized in that the testing device also comprises a magnetic powder brake ; a torque and rotating speed sensor , a flywheel and a DC generator are positioned on a mounting flat plate and are connected with the magnetic powder brake in sequence through a coupling ; the other end of the torque and rotating speed sensor serves as the connecting end of the axle-stretch end of a motor upon testing ; the DC excitation port of the magnetic powder brake is connected with a controllable DC power supply in a permanent magnet motor comprehensive testing control cabinet ; a photoelectric encoder is arranged on a fan end of the motor upon testing . The microcomputer comprehensive testing device for an automatic-start rare earth permanent magnet motor can achieve the function of completing the static and dynamic torque testing on the same testing device , so as to save the ex-factory testing time of each motor .
Our solution to the feature pyramid in CNN descends from the observations of modern CNN - based detectors , including Faster - RCNN , R - FCN , SSD , YOLO and STN , where feature maps are first computed and the detection results are decoded from the maps afterwards . However , the computation cost of generating feature maps becomes a bottleneck for methods using multi - scale testing and it seems not to be a neat solution to the scale variation problem . To this end , our philosophy of designing an elegant detection system is that we calculate the feature pyramid once only , and only through that pyramid can we approximate the rest feature pyramids at other scales .
We utilize multi - scale training where the input image is resized with bilinear interpolation to various scales ( say , 1024 or 1200 ) . In the testing stage , multi - scale testing is performed by scale image into an image pyramid for better detecting on both tiny and general faces . subsection : Comparison on Benchmarks
It is anticipated that use of this type of speech prosthesis will be more difficult to learn than the use of conventional communication aids , but the flexibility of this approach will be much greater . The difficulty in this approach arises because the complexity of the human interface must be limited while sufficient information must be obtained to permit synthesis of speech sounds at conversational rates . A prototype has been constructed , and experimentation and further development are discussed.<<ETX > >
The processing of speech involves the analysis , coding , decoding , and synthesis of speech sounds . The speech analyzer consists of normalizers , syllable and syblet segmenters , sound recognizers , sequencers , adapters , and memories which convert the speech elements into a code .
The design procedure for higher order group delay filters as a cascade of second order filters is first described . These higher order filters enable the synthesis of speech sounds by simultaneously varying the height and bandwidth of the group delay spectrum . The group delay filter response is corrected by removing zeros in close proximity to the unit circle which give rise to abrupt phase transitions at points of significant excitation .
Nonlinear interactions may impose several restrictions to numerical simulation attempts , in particular concerning the design of unconditionally stable algorithms . Such algorithms are required for real-time synthesis applications where virtual instruments may be modified on-line . One characteristic case of nonlinear interactions is that of impact sounds . This paper gives a brief summary of recently developed numerical techniques that are suitable for the simulation of systems involving collisions . A simple numerical example , involving a lumped collision model , is used to demonstrate the methodology , and further perspectives concerning the applicability of the presented family of schemes to real-time synthesis applications are discussed .
Analysis on numerical simulations shows that the system behaves qualitatively as higher-dimensional models ( such as the two-mass model by Ishizaka and Flanagan ) ; in particular , control over flow skewness is guaranteed , allowing for synthesis of realistic glottal flow waveforms . As only one degree of freedom ( one mass ) is needed in the model , structure and number of parameters are drastically reduced , thus making it suitable for real-time synthesis applications .
In this work we address the problem of multiple-level Boolean logic networks synthesis using genetics algorithms , aimed at achieving area-efficient implementation . The initial population is based on all kernels of the network .
NFG Optimum Control Synthesis via Switched Fuzzy Time-Delay Systems . A solution to the design of intelligent , optimum guaranteed-cost and robust , control for a class of uncertain switched nonlinear systems via switched fuzzy models possessing time delays and uncertainties has been developed .
The esters synthesis dynamics was similar for the free and the immobilized cell which was confirmed by the kinetic model . The dynamics of the higher alcohol synthesis was comparable for the free and immobilized cell , but there were some differences . The dynamics of the higher alcohols accumulation for the free and immobilized cells was similar , but there were some differences between the two used strains .
In this paper we propose a method of synthesizing statecharts from multiple scenarios , with respect to the relationships among them . We describe a set of rules for the synthesis of statecharts from multiple scenarios , as a means to properly describe the requirements speci£cations of a system .
By comparison , computationally driven materials synthesis screening is still in its infancy , and is mired by the challenges of data sparsity and data scarcity : Synthesis routes exist in a sparse , high-dimensional parameter space that is difficult to optimize over directly , and , for some materials of interest , only scarce volumes of literature-reported syntheses are available . In this article , we present a framework for suggesting quantitative synthesis parameters and potential driving factors for synthesis outcomes . We use a variational autoencoder to compress sparse synthesis representations into a lower dimensional space , which is found to improve the performance of machine-learning tasks .
In this paper , we propose a technique to synthesize a cost-efficient distributed platform consisting of multiple Application Specific Instruction Set Processors ( multi-ASIPs ) running applications with strict timing constraints . Multi-ASIP platform synthesis is a non-trivial task for two reasons . Firstly , we need to know the WCET of tasks in target applications to derive platforms ( including synthesized ASIPs ) in which the tasks are schedulable .
The report substantiates the concept of the analytic spectrum and the synthesis of time-frequency representations of signals based on it . A number of properties of the analytic spectrum are considered and their comparison with the corresponding properties of the analytic signal is carried out .
A particularly important aspect for extending existing methods to address composite systems is the ability , given programs that realise component specifications , to synthesise the interconnections between them in such a way that the system specification is realised . Taking our cue from earlier work on General Systems Theory ( Goguen , 1973 ) and more recent work on parallel program design ( Fiadeiro and Maibaum , 1996 ) , we discuss , characterise and provide solutions for the synthesis of interconnections using a categorical framework in which components are modelled as objects ( either specifications or programs ) and morphisms are used to express interconnections between components .
We then jointly fine - tune all the networks together . We use this generator design to effectively aggregate global and local information for the image synthesis task . We note that such a multi - resolution pipeline is a well - established practice in computer vision and two - scale is often enough .
Recently , several works learn to produce a fixed number of discrete outputs given the same input or synthesize diverse modes controlled by a latent code that encodes the entire image . Although these approaches tackle the multi - modal image synthesis problem , they are unsuitable for our image manipulation task mainly for two reasons . First , the user has no intuitive control over which kinds of images the model would produce .
To generate diverse images and allow instance - level control , we propose adding additional low - dimensional feature channels as the input to the generator network . We show that , by manipulating these features , we can have flexible control over the image synthesis process . Furthermore , note that since the feature channels are continuous quantities , our model is , in principle , capable of generating infinitely many images .
This mode seeking regularization term is readily applicable to various conditional generation tasks without imposing training overhead or modifying the original network structures . We validate the proposed algorithm on three conditional image synthesis tasks including categorical generation , image - to - image translation , and text - to - image synthesis with different baseline models . Both qualitative and quantitative results demonstrate the effectiveness of the proposed regularization method for improving diversity without loss of quality .
subsection : Conditioned on Text Text - to - image synthesis targets at generating images conditioned on text descriptions . We integrate the proposed regularization term on StackGAN ++ using the CUB - 200 - 2011 dataset .
Figure . [ reference ] shows the interpolation results on the dog - to - cat translation and the text - to - image synthesis task . In the dog - to - cat translation , we can see the coat colors and patterns varies smoothly along with the latent vectors .
This inability to easily search and organize the published literature impedes the aims of evidence based medicine ( EBM ) , which aspires to inform patient care using the totality of relevant evidence . Computational methods could expedite biomedical evidence synthesis and natural language processing ( NLP ) in particular can play a key role in the task . Prior work has explored the use of NLP methods to automate biomedical evidence extraction and synthesis .
Concatenative synthesis with unit selection , the process of stitching small units of pre - recorded waveforms together was the state - of - the - art for many years . Statistical parametric speech synthesis , which directly generates smooth trajectories of speech features to be synthesized by a vocoder , followed , solving many of the issues that concatenative synthesis had with boundary artifacts . However , the audio produced by these systems often sounds muffled and unnatural compared to human speech .
A comprehensive approach to the real-time simulation of power converters using a state-space representation is covered in this paper . Systematic formulations of state-space equations as well as a new switch model are presented . The proposed switch model exhibits a natural switching behavior , which is a valuable characteristic for the real-time simulation of power converters , thereby allowing individual treatment of switching devices irrespective of the converter topology . Successful implementations of the proposed switch model on a field programmable gate array ( FPGA ) device are reported , with two alternative approaches : 1 ) precomputing network equations for all switch state combinations and 2 ) solving network equations on-chip using the Gauss-Seidel iterative method .
In this paper , an indirect matrix converter ( IMC ) which makes directly ac-ac power conversion , is modeled and simulated in real-time to demonstrate the capability of the new link between Opal-RT 's eHS ( electric Hardware Solver ) and the CAD tool PSIM . An automatic methodology for the real-time simulation of power converters from PSIM circuit designs to FPGA is presented and discussed . A time-step of 250 ns is achieved on an FPGA computing engine developing up to 25.6 GFLOPS of processing power .
This paper deals with simulation of plant development and focuses on influence of light . Most of the previously published methods dealing with light in these simulations use sky discretization , source of aliasing error which was never mentioned in literature .
L-systems are parallel grammars that provide a theoretical foundation for a class of programs used in the simulation of plant development and procedural image synthesis . In particular , the formalism of L-systems guides the construction of declarative languages for specifying input to these programs .
Data acquisition interface is a necessary system in a Flight Simulation Device . Its action is to complete the series or parallel commucation between the master computer and other systems , send some of important information in data form to display devices .
In this paper the design of a bimanual haptic interface device for simulation of minimally invasive surgical procedures is described . Each of the two handles has five haptic degrees of freedom .
The paper advanced a novel modified discrete chirp-Fourier transform ( MDCFT ) to overcome the restriction , this new transform can make the signal energy concentrate in the transform domain to precisely estimate the parameters . The simulation SAR imaging based on the MDCFT proves that the new algorithm is more practical and effective .
A Grand Challenge . The future of air transportation modeling and simulation represents a grand challenge for both the air transportation and the modeling and simulation communities . In addition to its size and scope , air transportation has many technical , operational , organizational , policy , security and legal aspects contributing to its complexity , yet must ensure an un-rivaled level of safety throughout any transition to next generation systems .
Currently , in many engineering areas , including civil engineering , there are increasing demands for various modelling and simulation services that would be accessible over the Web . The basis for such solutions could be existing legacy applications with proven properties , such as numerical stability of the used algorithms .
parallel and distributed discrete event simulation distributed discrete-event simulation ece/cis parallel discrete event simulation with erlang1 arxiv parallel and distributed discrete event simulation parallel/distributed discrete event simulation execution parallel discrete event simulation : a shared memory approach ieee transactions on parallel and distributed systems 1 parallel discrete event simulation with anylogic distributed and parallel demand driven logic simulation a new mathematical model for optimizing the performance of parallel and distributed vhdl simulation cecs μsik – a micro-kernel for parallel/distributed simulation parallel discrete event simulation techniques for exploiting temporal uncertainty in parallel and parallel discrete-event simulation researchgate distribution of parallel discrete-event simulations in ges 10 case study ii : parallel discrete-event simulation performance factors in parallel discrete event simulation parallel/distributed simulation via eventreservation a simulation approach to facilitate parallel and parallel and distributed simulation ieee computer society μsik – a micro-kernel for parallel/distributed simulation chapter 13 towards flexible , reliable , high throughput 1999 : parallel and distributed simulation parallel discrete-event simulation tool for population 2001 : parallel and distributed simulation systems simulation modelling practice and theory semantic scholar distributed simulation of large computer systems parallel discrete-event simulation of population dynamics discrete event simulation tu wien parallel discrete event simulation using shared memory conservative distributed discrete event simulation on parallel simulation made easy with omnet++ composite synchronization in parallel discrete-event master/worker parallel discrete event simulation μsik – a micro-kernel for parallel/distributed simulation parallel and distributed spatial simulation of chemical variance reduction algorithms for parallel replicated lookahead accumulation in conservative parallel discrete distributed simulation with ns3 advances in parallel discrete event simulation for 4 , 397 asynchronous parallel discrete event sirnullation pdes-a : a parallel discrete event simulation accelerator jwarp : a java library for parallel discrete-event simulations scalable and flexible parallel/distributed simulation accelerating traffic microsimulations : a parallel discrete parallel and distributed discrete event simulation
The authors present the design and implementation of an airport simulator based on the entity-life model . The concurrency features of Ada , combined with the design principles of the entity-life model , are shown to be very appropriate to the airport simulation problem , which is inherently concurrent . The tasks resulting from the design based on the entity-life model were mostly isomorphic to the real-world entities they represent and thus helped make the design simpler in addition to capturing real-world concurrency which is so vital to many applications .
Given such a formal specification of system V&V ( Verification and Validation ) cases , dedicated co-simulation services will be developed to provide the support for automated configuration and execution of simulation tools . For quality management , the co-simulation services themselves will be specified and managed by models in SysML .
The next challenge for the communication society : co-operating embedded systems Discrete-time ZNN algorithms for time-varying linear matrix-vector inequality solving Optimization of viterbi decoder parameters for WRAN system Cross-memory polynomial modeling for RF circuits Refactoring digital hardware designs with assertion libraries High-Level Synthesis for Efficient Design and Verification Hardware design style: The vital element Using advanced FPGA SoC technologies for the design of industrial control applications Analog and Mixed-Signal Extensions to VHDL Ensuring Correct-by-Construction Resource Usage by using Full-Spectrum Dependent Types Some pedagogical aspects of proof Proof Checker for Extended Linear Time Temporal Logic Proofs About Small Concurrent Programs Efficient Certified Resolution Proof Checking New types of contrapositivisation of fuzzy implications with respect to fuzzy negations Theorem Provers as a Learning Tool in Theory of Computation On the Mathematical Foundations of Syntactic Structures Fault prediction by utilizing self-organizing Map and Threshold CORECT: Using Natural Language Generation as an Integral Part of a CSCW Tool for Collaborative Requirements Capture Property-based testing: a new approach to testing for assurance Design of a Fuzzy model to detect equivalent mutants for weak and strong mutation testing Test Strategy Generation Using Quantified CSPs Kernel Korner: Running Linux with Broken Memory Laboratory reliability demonstration test considerations Air conditioning equipment using dc power supply system Dynamic analysis of Bayesian audit strategies with tests of controls and reliability modeling Self-starting rare-earth permanent magnet rotor type electric motor microcomputer integrated test apparatus Recurrent Scale Approximation for Object Detection in CNN Detecting Faces Using Region-based Fully Convolutional Networks Articulator-based synthesis for conversational speech Speech processing techniques and applications Significance of variable height-bandwidth group delay filters in the spectral reconstruction of speech Digital synthesis of impact sounds One-delayed-mass model for efficient synthesis of glottal flow Boolean networks decomposition using genetic algorithms Intelligent Control of Uncertain Switched Nonlinear Plants: NFG Optimum Control Synthesis via Switched Fuzzy Time-Delay Systems Modeling Of Alcohol Fermentation In Brewing - Comparative Assessment Of Flavor Profile Of Beers Produced With Free And Immobilized Cells Synthesizing statecharts from multiple interrelated scenarios Virtual screening of inorganic materials synthesis parameters with deep learning Multi-ASIP platform synthesis for Event-Triggered applications with cost/performance trade-offs Analytic spectrum as a tool for time-frequency signal analysis Synthesising interconnections High-Resolution Image Synthesis and Semantic Manipulation with Conditional GANs Mode Seeking Generative Adversarial Networks for Diverse Image Synthesis A Corpus with Multi-Level Annotations of Patients, Interventions and Outcomes to Support Language Processing for Medical Literature Natural TTS Synthesis by Conditioning Wavenet on MEL Spectrogram Predictions A State-Space Modeling Approach for the FPGA-Based Real-Time Simulation of High Switching Frequency Power Converters FPGA-based real-time simulation of a PSIM model: An indirect matrix converter case study Visual Model of Plant Development with Respect to Influence of Light Design and Implementation of the L+C Modeling Language Upgrade and Development of Data Acquisition for Flight Simulation Mechanical Characterization of the Immersion Corp. Haptic, Bimanual, Surgical Simulator Interface Doppler frequency parameters estimation for SAR imaging using a modified discrete chirp-Fourier transform Looking into the Future of Air Transportation Modeling and Simulation: A Grand Challenge Enabling Legacy Engineering Applications for Cloud Computing: Experience with the mOSAIC API and Platform Parallel and Distributed Discrete Event Simulation Concurrent simulation with entity life modeling: an airport simulator using Ada An Investigation of Model-Based Design Framework for Aero-Engine Control Systems
829e8743da11eb7a44ace56d1dafcd9e6eb44451 2d80b04dc5a142416b28e28ba2eb45e5d87bfe08 9b262c6afa272259aae0835c5694379f4d892f5d f2b79cc4334fd25c10f061eddc6e5734255a413d b2c930fb5a6d31024c43eb7fe47c962135d9ef5f fd98f416ce771da7fe7c990f486d7046da69946d 9acaa2ac930077e15f782dc07ad22bd0da31ae3b cd5de402ca2c4dbdf8c4326132a6ab1de209549c 7c6056bd302c368067d9cb41c9d9b15e60a10ffe 8ff47b83b672ece272ab408923b723dac8ca262d deea0de8cfb11b9650d59d151b9078d57d81e29b 5c06c86b9db23ab4c99b23ac34197eae1183cc9d 471a4f027b8322eee4d0ba1bfa717363068e3261 8a380bded6fd40158b528b2813f35aeb50430c69 bf8e9178bf8ce3d606c676ac56664fc1f01a8afa d21c885c20289aff78121f3a0a50f600dd217704 1b1a0f581fccfbbda07a187373618fb8e65647e1 07a82cc42790d3c6826d09451594da7feec43a8f 8b1f371310de3e237a994be89393373e27126593 7435c89d4c185780574e76c0dfc962ae5a735c29 6465c784810d230c43ddafa1e4d7e141d1a4a9b6 fd798bc0992c27b26b9c2fd2bfae1d77ce6bf1dd 94d50553dc869b594a34bace24c93f06f1dd9de2 c792a750df6987aececd841bfb55f1dab302bf51 607adde996d64c35a11663b0886932ad07fb44d8 b456323e1d818330cd276150590a971422ea7fdc f583bd0172977940900c62620f7f732fb8d59fef e618a17eb5cc6a51b5ffea531838c91c1a19c5b5 3a5c94213c9387f6e6b59f7633e5a4342b961727 b4a1bb25ac44fb7e18db4eb27507f1796e693637 3b15bbd05749927c2000b4cc406c43ec4fa580eb 5aaea6e15cf58950a0bdec2473340d0ec172ed64 38bd5e1fb813ef8f9aa43bcc27aef72363dab14c 08be169ed5255612bf736d4791d6d09d98937944 8a37d5bab0b36112279a00f0956246890feb3747 552af0013c9ff1aa906356d6383dc326cb57ee4a b16720397695ef84514e293f4c5b6f52a89f6fdc b27eff0a513945ff18d276a7ecd00546394e252a 77162c8302ba6f6743efc7ee34677ae213b0754c 630ebff6f8e916dae7848ee84365ceca4ac9d516 74c4555f35ffbbc10463de14b3483382b249694b e50e4d137cb4bca5de038a52144611f249b34fd5 019159e152c7af54bc3263efb2e7715c0fd345b7 8dd9dc2d00721f60b04bc2b84aa24fb19ccf26f3 84c40ac4a03eb8815d923357f5c8e14accb1256b 300f45a9c203e639214ced919d89609d09e9e24d 461903c1bc2afbf6bfa1773028f3cf265472924f f74ee924cc81f98a2d0fb4782c7800a67b33be56 9ac83fb96d3f7641c4d6e20abadab2451daf5b20 389351c89a901916c081dafe58555c19762ec613 f8d631de370fafd043201c42be0a39c924bdab30
["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Sociology"] ["Computer Science"] ["Computer Science"] ["Computer Science","Mathematics"] ["Computer Science"] ["Philosophy","Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science","Engineering"] ["Engineering"] ["Computer Science","Engineering"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Engineering"] ["Computer Science"] ["Computer Science","Chemistry"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science","Mathematics"] ["Computer Science"] ["Computer Science"] ["Engineering","Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Engineering","Mathematics"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"]
2003 2012 2010 2012 2003 1976 2015 1998 2009 1990 2018 2017 2015 2017 2011 2013 1996 1997 2016 2008 2001 2001 2017 2011 2007 2017 2017 1990 1967 2013 2015 2001 1997 2018 2013 2002 2017 2013 2017 1997 2018 2019 2018 2018 2012 2015 1997 2003 2006 2003 2005 2007 2012 2002 1990 2016
HLDVT IISA TACAS (1) ICER ICCSCE CP 2017 IEEE International Conference on Computer Vision (ICCV) ArXiv ICASSP INTERSPEECH Audio Mostly Conference INTERSPEECH ECMS RTCSA ISPA 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) ACL 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) IECON Computer Animation and Simulation ISER EIDWT Winter Simulation Conference
https://api.semanticscholar.org/829e8743da11eb7a44ace56d1dafcd9e6eb44451 https://api.semanticscholar.org/2d80b04dc5a142416b28e28ba2eb45e5d87bfe08 https://api.semanticscholar.org/9b262c6afa272259aae0835c5694379f4d892f5d https://api.semanticscholar.org/f2b79cc4334fd25c10f061eddc6e5734255a413d https://api.semanticscholar.org/b2c930fb5a6d31024c43eb7fe47c962135d9ef5f https://api.semanticscholar.org/fd98f416ce771da7fe7c990f486d7046da69946d https://api.semanticscholar.org/9acaa2ac930077e15f782dc07ad22bd0da31ae3b https://api.semanticscholar.org/cd5de402ca2c4dbdf8c4326132a6ab1de209549c https://api.semanticscholar.org/7c6056bd302c368067d9cb41c9d9b15e60a10ffe https://api.semanticscholar.org/8ff47b83b672ece272ab408923b723dac8ca262d https://api.semanticscholar.org/deea0de8cfb11b9650d59d151b9078d57d81e29b https://api.semanticscholar.org/5c06c86b9db23ab4c99b23ac34197eae1183cc9d https://api.semanticscholar.org/471a4f027b8322eee4d0ba1bfa717363068e3261 https://api.semanticscholar.org/8a380bded6fd40158b528b2813f35aeb50430c69 https://api.semanticscholar.org/bf8e9178bf8ce3d606c676ac56664fc1f01a8afa https://api.semanticscholar.org/d21c885c20289aff78121f3a0a50f600dd217704 https://api.semanticscholar.org/1b1a0f581fccfbbda07a187373618fb8e65647e1 https://api.semanticscholar.org/07a82cc42790d3c6826d09451594da7feec43a8f https://api.semanticscholar.org/8b1f371310de3e237a994be89393373e27126593 https://api.semanticscholar.org/7435c89d4c185780574e76c0dfc962ae5a735c29 https://api.semanticscholar.org/6465c784810d230c43ddafa1e4d7e141d1a4a9b6 https://api.semanticscholar.org/fd798bc0992c27b26b9c2fd2bfae1d77ce6bf1dd https://api.semanticscholar.org/94d50553dc869b594a34bace24c93f06f1dd9de2 https://api.semanticscholar.org/c792a750df6987aececd841bfb55f1dab302bf51 https://api.semanticscholar.org/607adde996d64c35a11663b0886932ad07fb44d8 https://api.semanticscholar.org/b456323e1d818330cd276150590a971422ea7fdc https://www.semanticscholar.org/paper/28704b0b48948f538cd346a4296ebde5bdba1efb https://www.semanticscholar.org/paper/2e942d19333651bf6012374ea9e78d6937fd33ac https://api.semanticscholar.org/f583bd0172977940900c62620f7f732fb8d59fef https://api.semanticscholar.org/e618a17eb5cc6a51b5ffea531838c91c1a19c5b5 https://api.semanticscholar.org/3a5c94213c9387f6e6b59f7633e5a4342b961727 https://api.semanticscholar.org/b4a1bb25ac44fb7e18db4eb27507f1796e693637 https://api.semanticscholar.org/3b15bbd05749927c2000b4cc406c43ec4fa580eb https://api.semanticscholar.org/5aaea6e15cf58950a0bdec2473340d0ec172ed64 https://api.semanticscholar.org/38bd5e1fb813ef8f9aa43bcc27aef72363dab14c https://api.semanticscholar.org/08be169ed5255612bf736d4791d6d09d98937944 https://api.semanticscholar.org/8a37d5bab0b36112279a00f0956246890feb3747 https://api.semanticscholar.org/552af0013c9ff1aa906356d6383dc326cb57ee4a https://api.semanticscholar.org/b16720397695ef84514e293f4c5b6f52a89f6fdc https://api.semanticscholar.org/b27eff0a513945ff18d276a7ecd00546394e252a https://api.semanticscholar.org/77162c8302ba6f6743efc7ee34677ae213b0754c https://www.semanticscholar.org/paper/f0a0c0f0d6a7ff53abea40a8c0c678ed570bf851 https://www.semanticscholar.org/paper/cec3bffdb0968cd820863005af54cc519704c24a https://www.semanticscholar.org/paper/0a78873e41615798d09391d9f40d41666b8c9beb https://www.semanticscholar.org/paper/1a2599e467e855f845dcbf9282f8bdbd97b85708 https://api.semanticscholar.org/630ebff6f8e916dae7848ee84365ceca4ac9d516 https://api.semanticscholar.org/74c4555f35ffbbc10463de14b3483382b249694b https://api.semanticscholar.org/e50e4d137cb4bca5de038a52144611f249b34fd5 https://api.semanticscholar.org/019159e152c7af54bc3263efb2e7715c0fd345b7 https://api.semanticscholar.org/8dd9dc2d00721f60b04bc2b84aa24fb19ccf26f3 https://api.semanticscholar.org/84c40ac4a03eb8815d923357f5c8e14accb1256b https://api.semanticscholar.org/300f45a9c203e639214ced919d89609d09e9e24d https://api.semanticscholar.org/461903c1bc2afbf6bfa1773028f3cf265472924f https://api.semanticscholar.org/f74ee924cc81f98a2d0fb4782c7800a67b33be56 https://api.semanticscholar.org/9ac83fb96d3f7641c4d6e20abadab2451daf5b20 https://api.semanticscholar.org/389351c89a901916c081dafe58555c19762ec613 https://api.semanticscholar.org/f8d631de370fafd043201c42be0a39c924bdab30