基于建构主义理论的《计算机组成原理》课程教学研究

根据《计算机组成原理》课程的特点,在对建构主义理论分析的基础上,将《计算机组成原理》教学与建构主义理论相结合,对基于建构主义理论的《计算机组成原理》课程的教学改革进行了探讨和分析,有利于进一步提高教学质量,培养学生良好的《计算机组成原理》教学素养和创新意识。     

Primal or dual: which promises faster spatiotemporal search?

The existing predictive spatiotemporal indexes can be classified into two categories, depending on whether they are based on the primal or dual methodology. Although we have gained considerable empirical knowledge about various access methods, currently there is only limited understanding on the theoretical characteristics of the two methodologies. In fact, the experimental results in different papers even contradict each other, regarding the relative superiority of the primal and dual techniques. This paper presents a careful study on the query performance of general primal and dual indexes, and reveals important insight into the behavior of each technique. In particular, we mathematically establish the conditions that determine the superiority of each methodology, and provide rigorous justification for well-known observations that have not been properly explained in the literature. Our analytical findings also resolve the contradiction in the experiments of previous work.     

A Theory of Constraints approach to interorganizational systems implementation

Interorganizational systems (IOS) may provide substantial benefits, however many organizations are reluctant to implement them. This empirical research takes a novel approach and develops a model of IOS feasibility, which is based on the Theory of Constraints (TOC). It introduces the notion of maximal infeasibility, which is the highest among the values of five factors: economic infeasibility, organizational infeasibility, technological infeasibility, risks, and lack of financial resources. The highest value was selected because implementation is hindered even if only one of the feasibility requirements is not fulfilled. Data collected from 139 medium and large Israeli business organizations validated the model, and indicated that strategic motivation is the main driving force for an organization to initiate or to join an IOS, while the main barriers are organizational infeasibility issues such as lack of management support or uninterested potential partners. Adopting a TOC approach to IOS implementation may assist organizations to overcome these obstacles and increase the chance of a successful implementation. An earlier shorter version of this paper was presented at WEB 2006, a pre-ICIS workshop on e-business, in Milwaukee, WI.     

On codes defined by bio-operations

We consider the classes of ⊕$\oplus$-codes and ⊗$\otimes$-codes, which are superclasses of outfix and hyper-codes, respectively. These restrictions are based on the synchronized insertion operation, which serves as a model for the gene rearrangement function in certain unicellular organisms. We investigate the classes of ⊕$\oplus$-codes and ⊗$\otimes$-codes from a theoretical perspective, examine their relationships with traditional code classes and consider related decidability problems.     

E—mail营销研究

首先讨论了E-mail营销的产生和理论基础,然后分析了客户数据库的建立与使用,最后,对增强E-mail营销效果的对策进行了研究。     

不同抗生大豆品种与大豆胞囊线虫的田间群体动态关系研究

阐述了以江泽民同志为核心的党的第三代领导集体,继承和发展了马克思列宁主义、毛泽东思想,在分析、研究、解决改革开放和社会主义现代化建设面临的新情况、新问题的过程中,从六个方面创造性地坚持和发展了邓小平理论.     

中科院声学所知识创新工程项目基于内容分析的中文问答处理算法及系统实现*

提出了一种基于HNC自然语言理解框架下的中文问答处理算法,并在此算法基础上加以系统实现。试验证明,该系统在中等规模常识库基础上效果显著、准确率高。     

Learning commutative deterministic finite state automata in polynomial time

We consider the problem of learning the commutative subclass of regular languages in the on-line model of predicting {0,1∼-valued functions from examples and reinforcements due to Littlestone [7,4]. We show that the entire class of commutative deterministic finite state automata (CDFAs) of an arbitrary alphabet sizek is predictable inO(s ^k) time with the worst case number of mistakes bounded above byO(s ^kk logs), wheres is the number of states in the target DFA. As a corollary, this result implies that the class of CDFAs is also PAC-learnable from random labeled examples in timeO(s ^k) with sample complexity, using a different class of representations. The mistake bound of our algorithm is within a polynomial, for a fixed alphabet size, of the lower boundO(s+k) we obtain by calculating the VC-dimension of the class. Our result also implies the predictability of the class of finite sets of commutative DFAs representing the finite unions of the languages accepted by the respective DFAs. Part of this work was supported by the Office of Naval Research under contract number N00014-87-K-0401 while the author was at the Department of Computer and Information Science, University of Pennsylvania, and N0014-86-K-0454 while at the Department of Computer and Information Sciences, U.C. Santa Cruz. The author’s email address is abe@IBL.CL.nec.co.jp     

The contingent role of dependency in predicting the intention to adopt B2B e-commerce

ABSTRACT

A review of existing Electronic Commerce adoption literature reveals that the prevailing theoretical frameworks implicitly assume that organizations are independent and have complete control over their decisions to adopt innovations. Given the fact that organizations are often constrained by and depend on their environment and exchange partners to survive, this paper proposes that Resource Dependency can either be a facilitator or inhibitor of the role of Technological, Organizational, and Environmental (TOE) motivating factors. Using 239 valid responses from supply chain managers in Jordan, the study found partial support for the role of Resource Dependency as a moderator. The findings provide insights on how Resource Dependency between partners drives different patterns of innovation acceptance among potential adopters, regardless of several technological and organizational motivations to innovate. The results suggest that predicting how innovation is diffused within a market needs a detailed understanding of the inter-dependence structure among the supply chain members.