Binarized neural networks (BNNs) are gaining interest in the deep learning community due to their significantly lower computational and memory cost. they are particularly well suited to reconfigurable logic devices, w...
详细信息
We argue in favour of teaching modern programming to students of "non-scientific" undergraduate disciplines (humanities), considering that computer-assisted learning should not be reduced to the usage of too...
详细信息
ISBN:
(纸本)9789897581793
We argue in favour of teaching modern programming to students of "non-scientific" undergraduate disciplines (humanities), considering that computer-assisted learning should not be reduced to the usage of tools, but provides some answers to the question: how the knowledge is built. the computer science should be treated as an inherent part of their culture. We advocate the teaching of logicprogramming languages: Prolog, and of the Constraint programming languages, such as CHR. logicprogramming permits to formulate the computational problems and their solutions in a form more close to human reasoning than several other languages, and adaptable to the domains of interest of the learners.
Block-C is a block-based programming learning tool for C programming language that uses the recognition over recall approach on top of the rigid and complex constructs of C language. It empowers students to learn prog...
详细信息
ISBN:
(纸本)9781509054671
Block-C is a block-based programming learning tool for C programming language that uses the recognition over recall approach on top of the rigid and complex constructs of C language. It empowers students to learn programming by guiding them to focus on the programminglogic rather than the syntax of C language. Novice programmers in introductory programming courses are more productive withthe use of Block-C than with regular textual C programming. they can internalize the programming concepts more easily by gradually assigning meaning to the visual models (pertaining to the programminglogic) created using the tool. In lab or tutorial sessions, where the presence of facilitators is limited, Block-C can guide the students to complete their assignments easily and effectively. Finally, Block-C promotes the transition to the regular textual C programming by allowing the students to export their code and see how their block-based programs are translated to textual C, but also how textual C is translated to block-based C.
the proceedings contain 12 papers. the topics discussed include: modelling and formal verification of neuronal archetypes coupling;estimating respiration rate using an accelerometer sensor;formal validation of neural ...
ISBN:
(纸本)9781450353502
the proceedings contain 12 papers. the topics discussed include: modelling and formal verification of neuronal archetypes coupling;estimating respiration rate using an accelerometer sensor;formal validation of neural networks as timed automata;the effect of reference species on reference-guided genome assembly;a machine learning approach for drug discovery from herbal medicine: metabolite profiles to therapeutic effects;identifying microRNA targets in epithelial-mesenchymal transition using joint-intervention causal inference;position-residue specific dynamic gap penalty scoring strategy for multiple sequence alignment;extraction of disease-related genes from PubMed paper using word2vec;proposal of application method of inductive logicprogramming to microarray data;meta-analysis of whole-transcriptome data for prediction of novel genes associated with autism spectrum disorder;in silico structure based designing of dihydrofolate reductase enzyme antagonists and potential small molecules that target DHFR protein to inhibit the folic acid biosynthetic pathways;drug repurposing: targeting mTOR inhibitors for anticancer activity;AI and big data analytics for health and bioinformatics;and revealing deep proteome diversity with community-scale proteomics big data.
In previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form if antecedent then consequent true in a canonical model of a logi...
详细信息
In previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form if antecedent then consequent true in a canonical model of a logic program determined by an initial state, sequence of events, and the resulting sequence of subsequent states. In this model-theoretic semantics, reactive rules are the driving force, and logic programs play only a supporting role. In the canonical model, states, actions, and other events are represented with timestamps. But in the operational semantics (OS), for the sake of efficiency, timestamps are omitted and only the current state is maintained. State transitions are performed reactively by executing actions to make the consequents of rules true whenever the antecedents become true. this OS is sound, but incomplete. It cannot make reactive rules true by preventing their antecedents from becoming true, or by proactively making their consequents true before their antecedents become true. In this paper, we characterize the notion of reactive model, and prove that the OS can generate all and only such models. In order to focus on the main issues, we omit the logicprogramming component of the framework.
It is widely acknowledged that function symbols are an important feature in answer set programming, as they make modelling easier, increase the expressive power, and allow us to deal with infinite domains. the main is...
详细信息
It is widely acknowledged that function symbols are an important feature in answer set programming, as they make modelling easier, increase the expressive power, and allow us to deal with infinite domains. the main issue withtheir introduction is that the evaluation of a program might not terminate and checking whether it terminates or not is undecidable. To cope withthis problem, several classes of logic programs have been proposed where the use of function symbols is restricted but the program evaluation termination is guaranteed. Despite the significant body of work in this area, current approaches do not include many simple practical programs whose evaluation terminates. In this paper, we present the novel classes of rule-bounded and cycle-bounded programs, which overcome different limitations of current approaches by performing a more global analysis of how terms are propagated from the body to the head of rules. Results on the correctness, the complexity, and the expressivity of the proposed approach are provided.
Incorporating VHDL programming and implementation using programmable logic devices (PLD) in fundamental digital design course for Electronics Engineering at undergraduate level has become increasingly essential. Howev...
详细信息
ISBN:
(纸本)9781509061150
Incorporating VHDL programming and implementation using programmable logic devices (PLD) in fundamental digital design course for Electronics Engineering at undergraduate level has become increasingly essential. However it is experienced that integration of VHDL with fundamentals of digital design in one course students give lesser time and importance for VHDL programming. Hence learning objective related to VHDL programming is not achieved up to the expected level. Experience of giving additional training to interested students had shown improvement in students' performance. this paper discusses effect of designing of a separate compulsory laboratory course in VHDL and its effect on the understanding of students and achieving the learning objectives. It also discusses the effect on performance of students in Digital Design course after separating VHDL programming from it. the feedback of students shows that students learn better in laboratory course and they are motivated to learn further in the same area.
Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each var...
详细信息
Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each variant requires a new algorithm for finding the stable matchings. To address this issue, we propose an encoding of the SMP using answer set programming (ASP), which can straightforwardly be adapted and extended to suit the needs of specific applications. the use of ASP also means that we can take advantage of highly efficient off-the-shelf solvers. To illustrate the flexibility of our approach, we show how our ASP encoding naturally allows us to select optimal stable matchings, i.e. matchings that are optimal according to some user-specified criterion. To the best of our knowledge, our encoding offers the first exact implementation to find sex-equal, minimum regret, egalitarian or maximum cardinality stable matchings for SMP instances in which individuals may designate unacceptable partners and ties between preferences are allowed.
the paper proposes a fresh look at the concept of goal and advances that motivational attitudes like desire, goal and intention are just facets of the broader notion of (acceptable) outcome. We propose to encode the p...
详细信息
the paper proposes a fresh look at the concept of goal and advances that motivational attitudes like desire, goal and intention are just facets of the broader notion of (acceptable) outcome. We propose to encode the preferences of an agent as sequences of "alternative acceptable outcomes". We then study how the agent's beliefs and norms can be used to filter the mental attitudes out of the sequences of alternative acceptable outcomes. Finally, we formalise such intuitions in a novel Modal Defeasible logic and we prove that the resulting formalisation is computationally feasible.
A flowchart can be a graphic diagram representation of a programminglogic. there are shapes and connectors that represent the different types of actions or steps in a process. A flowchart is a very important tool in ...
详细信息
A flowchart can be a graphic diagram representation of a programminglogic. there are shapes and connectors that represent the different types of actions or steps in a process. A flowchart is a very important tool in the planning phase in a program de velopment cycle. Programmers can use it to design and develop an algorithm of a program. Moreover, a flowchart is also very effective for visual learners to write and comprehend algorithms in computer programming courses. this paper aims to provide a tool which serves as an automatic code generator using a structured flowchart. the tool is composed of basic flowchart shapes to be combined into a structured flowchart that can be converted into source codes. In addition, the system’s performance has been evaluated by two grou ps: 5 experts and 93 general users. the results showed the average values of the satisfaction levels were 4.48 and 4.27 with standard deviations at 0.59 and 0.64 for the experts and the general users respectively. It was found that the system performance of the tool reached an agree level. It was revealed that the developed system can be used precisely as intended in an effective manner.
暂无评论