检索结果-内蒙古大学图书馆

30th international conference on Computers in Education (ICCE)

作者： Igawa, Ikkei Taniguchi, Yuta Minematsu, Tsubasa Okubo, Fumiya Shimada, Atsushi Kyushu Univ Fukuoka Japan

ISBN: (纸本)9789869721493

Since the demand for programmers is increasing, programming courses are being offered widely. In this context, students' motivation can be damaged by difficulties they encounter in their programming courses. Although teachers' support is necessary to prevent such an issue, it is impossible for teachers to directly monitor all students' programming activities at the same time and determine which students have troubles with programming. therefore, several studies have been conducted to help teachers monitor students. However, these studies do not provide an understanding of the activities of students who do not run their code, which may lead researchers to miss students who are in trouble. In this paper, we propose an indicator for detecting students who need coding support by analyzing programming logs that are recorded even when the students do not run their code. this gives teachers deeper insight into the students' programming performance. Although further work remains, the validation of this indicator shows that it could detect those students who are in trouble.

关键词： programming education educational data analysis clustering teacher support

来源：评论

学校读者我要写书评

暂无评论

2008 ACM/IEEE 30th international conference on software engineering,ICSE 2008

2008 ACM/IEEE 30th international conference on software engi...

引用

2008 ACM/IEEE 30th international conference on Software Engineering, ICSE 2008

ISBN: (纸本)9781605580791

the proceedings contain 104 papers. the topics discussed include: answering conceptual queries with ferret;specification patterns for probabilistic quality properties;existential live sequence charts revisited;symbolic mining of temporal specifications;testing pervasive software in the presence of context inconsistency resolution services;towards reusable components with aspects: an empirical study on modularity and obliviousness;early prediction of software component reliability;mining library specifications using inductive logic programming;temporal dependency based checkpoint selection for dynamic verification of fixed-time constraints in grid workflow systems;precise memory leak detection for java software using container profiling;static detection of cross-site scripting vulnerabilities;and a comparative analysis of the efficiency of change metrics and static code attributes for defect prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning logic Programs Using Neural Networks by Exploiting Symbolic Invariance 1

引用

30th international conference on Inductive logic programming (ILP) held as part of the 1st international Joint conference on Learning and Reasoning (IJCLR)

作者： Phua, Yin Jun Inoue, Katsumi Grad Univ Adv Studies SOKENDAI Tokyo Japan Natl Inst Informat Tokyo Japan

ISBN: (数字)9783030974541

ISBN: (纸本)9783030974541;9783030974534

Learning from Interpretation Transition (LFIT) is an unsupervised learning algorithm which learns the dynamics just by observing state transitions. LFIT algorithms have mainly been implemented in the symbolic method, but they are not robust to noisy or missing data. Recently, research works combining logical operations with neural networks are receiving a lot of attention, with most works taking an extraction based approach where a single neural network model is trained to solve the problem, followed by extracting a logic model from the neural network model. However most research work suffer from the combinatorial explosion problem when trying to scale up to solve larger problems. In particular a lot of the invariance that hold in the symbolic world are not getting utilized in the neural network field. In this work, we present a model that exploits symbolic invariance in our problem. We show that our model is able to scale up to larger tasks than previous work.

关键词： Neural network LFIT Interpretability Neural-Symbolic AI

来源：评论

学校读者我要写书评

暂无评论

NORA: Algorithmic Balancing without Pre-charge to thwart Power Analysis Attacks 30

NORA: Algorithmic Balancing without Pre-charge to Thwart Pow...

引用

30th international conference on VLSI Design / 16th international conference on Embedded Systems (VLSID)

作者： Jayasinghe, Darshana Ignjatovic, Aleksandar Parameswaran, Sri Univ New South Wales Sch Comp Sci & Engn Kensington NSW Australia

ISBN: (纸本)9781509057405

Power analysis attacks use power dissipation to find the secret key of cryptographic devices. Two of the main techniques used as the countermeasures of power analysis attacks are masking and balancing. this paper considers countermeasures with balancing only. All balancing methods proposed so far require a pre-charge (or a pre-clear) state for all registers in which the logic is initialized to logic '1' (or to logic '0') so that equal Hamming distances (HD) and Hamming weights (HW) are maintained. Pre-charging and pre clearing add additional clock cycles to the encryption algorithm. In this paper, for the first time, we present an algorithmic balancing technique (referred to as NORA;No Pre-charge) which does not require the pre-charge/pre-clear stage. the proposed balancing technique is explained as a generalized block cipher balancing technique and an Advanced Encryption Standard (AES) circuit is implemented as an example. Correlation power analysis attacks were carried out against 600,000 traces and Normalized Inter Class Variance (NICV) was used as the leakage evaluation methodology. the resulting circuit is the only complete AES circuit, which can balance both Hamming weights and Hamming distances without pre-charging or pre-clearing while resisting variability effects such as path imbalances and process variations. the circuit only consumes 8.1 x resources when compared to an unprotected AES circuit implemented on a Xilinx Kintex7-325T FPGA.

关键词： Registers Power dissipation logic gates High definition video Algorithm design and analysis Encryption Ciphers

来源：评论

学校读者我要写书评

暂无评论

A delay-encoding-logic array processor for dynamic-programming matching of data sequences

引用

IEEE JOURNAL OF SOLID-STATE CIRCUITS 2005年第7期40卷 1578-1582页

作者： Ogawa, M Shibata, T Univ Tokyo Dept Frontier Informat Tokyo 1138656 Japan

Computationally very expensive dynamic-program ming matching of data sequences has been directly implemented in a fully-parallel-architecture VLSI chip. the circuit operates as digital logic in the signal domain, while analog processing is carried out in the time domain based on the delay-encoding-logic scheme. As a result, a high-speed low-power best-match-sequence search has been established with a small chip area. the typical matching time of 80 ns with the power dissipation of 2 mW has been demonstrated with fabricated prototype chips.

关键词： analog VLSI dynamic-programming matching dynamic time warping pattern matching pulse-width modulation sequence matching time-domain circuit

来源：评论

学校读者我要写书评

暂无评论

Understanding, Refactoring, and Fixing Concurrency in C# 15

Understanding, Refactoring, and Fixing Concurrency in C#

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops (ASEW)

作者： Okur, Semih Univ Illinois Siebel Ctr 3213 Urbana IL 61801 USA

ISBN: (纸本)9781509000258

Industry leaders provide concurrent libraries because asynchronous & parallel programming are increasingly in demand: responsiveness, scalability, and high-throughput are key elements of all modern applications. However, we know little about how developers use these concurrent libraries in practice and the developer's toolbox for concurrency is very limited. We present the first study that analyzes the usage of concurrent libraries in large codebases, such as 2258 open-source C# apps comprising 54M SLOC and 1378 open-source Windows Phone apps comprising 12M SLOC. Using this data, we find important problems about use and misuse of concurrency. Inspired by our findings, we designed, evaluated, and implemented several static analyses and refactoring tools.

关键词： Libraries Java Concurrent computing Parallel programming Open source software Reactive power

来源：评论

学校读者我要写书评

暂无评论

A New Method Based on Dynamic programming for Boundary Detection in Ultrasound Image Sequences

A New Method Based on Dynamic Programming for Boundary Detec...

引用

30th Annual international conference of the IEEE-Engineering-in-Medicine-and-Biology-Society

作者： Holdfeldt, Peter Viberg, Mats Gustavsson, Tomas Chalmers Univ Technol Dept Signals & Syst Gothenburg Sweden

ISBN: (纸本)9781424418145

Dynamic programming has previously been used when measuring Lumen Diameter (LD) and Intima-Media thickness (IMT) in single frame ultrasound carotid artery images [1]. An extension to multiframe detection of that procedure is proposed in this paper. Our new method transforms a three dimensional problem into multiple two dimensional problems that can again be solved by dynamic programming. First, several "candidate boundaries" are detected in each image. then, one boundary from each image in the sequence is selected in such a way that the sequence of boundaries is optimal among the considered possibilities. A model of the movements of the boundaries is used in the second step. Our proposed method shows promising performance on both synthetic and real ultrasound data.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A Novel Power Reduction Technique Using Wire Multiplexing 30

A Novel Power Reduction Technique Using Wire Multiplexing

引用

30th IEEE international System-on-Chip conference (SOCC)

作者： Said, Mostafa Hassan, Hossam Kim, HyungWon Khamis, Mostafa Assiut Univ Dept Elect Engn Assiut Egypt Chungbuk Natl Univ Dept Elect Engn Cheongju 361763 South Korea Mentor Graph Egypt Cairo Egypt

ISBN: (纸本)9781538640340

Power consumption reduction is a very critical challenge in nowadays nanoscale circuits. In this paper, a new power reduction approach is demonstrated. this approach is originally based on the idea of TSV multiplexing in 3D-ICs where two or more signals can flow through one TSV instead of multiple TSVs. Based on that behavior, the possibility of power reduction of this circuit is discovered and its generalization to any wire, i.e., wire multiplexing, is detailed. Also, an analytical power model for this circuit is developed to predict its power consumption behavior. Further, and by means of Cadence-Spectre simulations on 65 nm technology and also using the developed analytical model, the power reduction of wire multiplexing technique could be proved and verified.

关键词： Integrated circuit modeling through-silicon vias Capacitance Power demand Wires logic gates Multiplexing

来源：评论

学校读者我要写书评

暂无评论

Efficient Binary Basic Linear Algebra Operations on ReRAM Crossbar Arrays 30

Efficient Binary Basic Linear Algebra Operations on ReRAM Cr...

引用

30th international conference on VLSI Design / 16th international conference on Embedded Systems (VLSID)

作者： Bhattacharjee, Debjyoti Chattopadhyay, Anupam Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore

ISBN: (纸本)9781509057405

Fast downscaling of technology features in CMOS fabrication processes have resulted in numerous insurmountable challenges, which prompted researchers to explore alternative storage and computing technologies. Resistive RAM (ReRAM) is a promising non-volatile storage technology with high endurance, high retention capacity and compatibility with CMOS manufacturing flow. More importantly, ReRAM devices exhibit capability to perform logic operations and therefore, provides an excellent platform for in-memory computing paradigm. Several prominent arithmetic and data analytic applications have been mapped on ReRAM crossbar array so far. Along this line of research, we undertake, for the first time, the mapping of binary-valued matrix-vector operations for ReRAM crossbar array. these linear algebra operations form the key component of diverse applications ranging from graph mining, image processing to bio-informatics. We perform detailed design exploration to obtain an efficient mapping, demonstrate the working flow and finally, present the impact of crossbar dimensions on performance.

关键词： logic arrays Arrays Linear algebra Data analysis CMOS technology Resistive RAM Data mining

来源：评论

学校读者我要写书评

暂无评论

Fuzzy active rules in mutimodal biometric systems

Fuzzy active rules in mutimodal biometric systems

引用

30th international conference on Information Technology Interfaces

作者： Rabuzin, Kornelije Baca, Miroslav Schatten, Markus Univ Zagreb Fac Org & Informat Varazhdin 42000 Croatia

ISBN: (纸本)9789537138127

this paper presents the idea how to use fuzzy active rules within biometric systems. We have already shown how the concept of complex events presented in the active database theory could be used in order to build a biometric system. We especially explored the paradigm of active rules and complex events and experimental results were encouraging. Fuzzy logic is very good when dealing with imprecision and uncertainty and hence it is suitable to be used in biometric systems. We will discuss how to apply fuzzy active rules in order to deal with imprecise decision making in multimodal biometric systems.

关键词： active databases biometrics multimodal biometric systems fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：