Integrating online and offline testing of a switching memory

A circuit used in a telephone switching unit features several test techniques, including BIST, partial scan, and boundary scan. By sharing the same circuitry for both online and offline testing, the design minimizes additional logic while achieving very high fault coverage     

A fast adaptive memetic algorithm for online and offline control design of PMSM drives.

A fast adaptive memetic algorithm (FAMA) is proposed which is used to design the optimal control system for a permanent-magnet synchronous motor. The FAMA is a memetic algorithm with a dynamic parameter setting and two local searchers adaptively launched, either one by one or simultaneously, according to the necessities of the evolution. The FAMA has been tested for both offline and online optimization. The former is based on a simulation of the whole system--control system and plant--using a model obtained through identification tests. The online optimization is model free because each fitness evaluation consists of an experimental test on the real motor drive. The proposed algorithm has been compared with other optimization approaches, and a matching analysis has been carried out offline and online. Excellent results are obtained in terms of optimality, convergence, and algorithmic efficiency. Moreover, the FAMA has given very robust results in the presence of noise in the experimental system.     

Free speech online and offline

Esther Dyson famously argued that as the world will never be perfect, whether online or offline, it is foolish to expect higher standards on the Internet than we accept in real life. Legislators are now turning this argument around, arguing that they must restrict traditional offline freedoms to regulate cyberspace. The author asserts that there is much that individual engineers can do to influence the development of technology law. Engineers and lawyers have started talking about technology policy, while some academics promote cross-disciplinary research at the boundary between information security and economics     

逆向教学设计在线上线下混合式教学改革中的实践

在对学生学情充分分析和混合式教学设计研究的基础上,应用逆向教学设计思想对计算机网络专业的"路由与交换技术"课程进行混合式教学的设计和实践,使课程教学目标、教学评价和教学活动更加协调一致.充分利用在线平台等技术手段,让课堂教学动起来,强化技能应用能力的培养.针对教学内容和教学目标,不断改进和优化教学活动,选择适合教学技术...     

A unified pipeline for online feature selection and classification

With the advent of Big Data, data is being collected at an unprecedented fast pace, and it needs to be processed in a short time. To deal with data streams that flow continuously, classical batch learning algorithms cannot be applied and it is necessary to employ online approaches. Online learning consists of continuously revising and refining a model by incorporating new data as they arrive, and it allows important problems such as concept drift or management of extremely high-dimensional datasets to be solved. In this paper, we present a unified pipeline for online learning which covers online discretization, feature selection and classification. Three classical methods—the k-means discretizer, the χ² filter and a one-layer artificial neural network—have been reimplemented to be able to tackle online data, showing promising results on both synthetic and real datasets.     

A hybrid multi-population framework for dynamic environments combining online and offline learning

Population based incremental learning algorithms and selection hyper-heuristics are highly adaptive methods which can handle different types of dynamism that may occur while a given problem is being solved. In this study, we present an approach based on a multi-population framework hybridizing these methods to solve dynamic environment problems. A key feature of the hybrid approach is the utilization of offline and online learning methods at successive stages. The performance of our approach along with the influence of different heuristic selection methods used within the selection hyper-heuristic is investigated over a range of dynamic environments produced by a well known benchmark generator as well as a real world problem, referred to as the Unit Commitment Problem. The empirical results show that the proposed approach using a particular hyper-heuristic outperforms some of the best known approaches in literature on the dynamic environment problems dealt with.     

Identity-based online/offline signcryption for low power devices

Confidentiality and authentication are the basic security requirements for many cryptographic applications. In this paper, we propose an efficient identity-based online/offline signcryption scheme, which is very suitable for low power devices such as smart cards or mobile devices. Our scheme has the following advantages: (i) It does not need to authenticate a public key and fulfills both confidentiality and authentication simultaneously at a lower cost. (ii) Most of computations are carried out offline and online part is very efficient. (iii) It does not require the message and the receiver's identity in the offline stage. The message and the receiver's identity are only needed in the online stage. Compared with the existing schemes, our scheme have the great advantage of the offline storage and ciphertext length.     

Scheduling with conflicts: online and offline algorithms

We consider the following problem of scheduling with conflicts (swc): Find a minimum makespan schedule on identical machines where conflicting jobs cannot be scheduled concurrently. We study the problem when conflicts between jobs are modeled by general graphs. Our first main positive result is an exact algorithm for two machines and job sizes in {1,2}. For jobs sizes in {1,2,3}, we can obtain a -approximation, which improves on the -approximation that was previously known for this case. Our main negative result is that for jobs sizes in {1,2,3,4}, the problem is APX-hard. Our second contribution is the initiation of the study of an online model for swc, where we present the first results in this model. Specifically, we prove a lower bound of on the competitive ratio of any deterministic online algorithm for m machines and unit jobs, and an upper bound of 2 when the algorithm is not restricted computationally. For three machines we can show that an efficient greedy algorithm achieves this bound. For two machines we present a more complex algorithm that achieves a competitive ratio of when the number of jobs is known in advance to the algorithm.     

A systematic methodology for firewall penetration testing

Firewall testing is one of the most useful of a set of alternatives for evaluating the security effectiveness of a firewall. A major advantage of firewall testing is being able to empirically determine how secure a firewall is against attacks that are likely to be launched by network intruders. This article advances the view that firewall testing should examine not only the ability of a firewall to resist attacks from external sources, but also the defences of the entire network that the firewall protects against external threats. Accordingly, testing should follow a systematic methodology to ensure that it is complete and appropriate, and to reduce the risk of damage and/or disruption to networks and hosts within.     

一种面向AADL架构的模型测试方法

鉴于模型在软件系统开发中日趋重要的地位和AADL模型在嵌入式软件建模中的良好应用前景,为了在嵌入式软件系统开发前期保证AADL模型的质量,提出了一种基于模型测试的AADL架构验证方法;该方法应用马尔可夫链描述AADL架构的行为,然后根据得到的马尔可夫链模型以及系统设计要求标准生成相应的测试用例和测试预言,并通过测试用例执行输出和期望值的比较判断AADL模型的正确性,实现对系统AADL模型的测试;最后通过案例分析证明了该方法的有效性。     

完全安全的身份基在线/离线加密

针对现有身份基在线/离线加密(IBOOE)机制仅满足较弱的选择安全模型,不允许攻击者适应性选择攻击目标的问题,将在线/离线密码技术引入到完全安全的身份基加密方案中,提出一种完全安全的身份基在线/离线加密方案。基于合数阶群上的3个静态假设,利用双系统加密技术证明该方案满足完全安全性。与知名的身份基在线/离线加密方案相比,所提方案不仅极大地提高了在线加密的效率,而且更能满足实际系统中对完全安全性的需求。     

结合在线/离线方法的无证书签密

作为密码学原语,签密同时具有签名的认证性与加密的机密性。在线/离线签密结合了在线/离线的方法,在已有基础上提高了系统的效率。但目前的在线/离线签密方案大多数都是在基于身份的环境下实现的,都存在密钥托管的安全问题。基于无证书密码体制撤销证书管理及无密钥托管问题的优点,提出了一种安全的在线/离线的无证书签密方案,满足离线阶段不需要确定接收者身份信息的条件,并在随机预言模型中证明了方案的安全性。     

可恢复消息的在线/离线签名

在线/离线签名是利用预处理技巧提高在线签名速度的签名形式。构造了一种可以恢复消息的在线/离线签名方案。因为不需要发送消息,该方案可以大大节约传输带宽。在随机预言模型下,新方案被证明是安全的。     

Efficient online/offline identity-based signature for wireless sensor network

In this paper, we present an online/offline identity-based signature scheme for the wireless sensor network (WSN). We argue that due to significant reduction in costs of computation and storage, our scheme is particularly suitable for the WSN environment with severely constrained resources. One of the interesting features of our scheme is that it provides multi-time usage of the offline storage, which allows the signer to re-use the offline pre-computed information in polynomial time, in contrast to one-time usage in all previous online/offline signature schemes. As evidence of the practicality and feasibility of our scheme to be used in the WSN environment, we provide an actual implementation result of our scheme on the MicaZ platform.     

A methodology for evolutionary product design

this paper describes a function-based approach for conceptual design support in the context of evolutionary product development. The main objective is to improve a designers productivity by the effective reuse of existing design information in design alternative identification, evaluation, and modification. An integrated evolutionary design methodology, EPD, is presented. The proposed methodology divides the whole process into three inter-related phases: information recovery, information management, and information reuse. The detailed steps in each phase are elaborated, and various techniques are employed to improve information reuse efficiency. A case study on commercial electrostatic air cleaner was used to illustrate the whole process of product evolutionary design. The proposed methodology will have a positive impact on the future development of the conceptual design support system.     

A design methodology for data-parallel applications

A methodology for the design and development of data-parallel applications and components is presented. Data-parallelism is a well understood form of parallel computation, yet developing simple applications can involve substantial efforts to express the problem in low level notations. We describe a process of software development for data-parallel applications starting from high level specifications, generating repeated refinements of designs to match different architectural models and performance constraints, enabling a development activity with cost benefit analysis. Primary issues are algorithm choice, correctness, and efficiency, followed by data decomposition, load balancing, and message passing coordination. Development of a data-parallel multitarget tracking application is used as a case study, showing the progression from high to low level refinements. We conclude by describing tool support for the process     

When online meets offline: A field investigation of modality switching

In order to explore the differing theoretical predictions of the cues-filtered-out perspective, SIDE model, and hyperpersonal model for online-to-offline relationships outside of the laboratory, a longitudinal survey study was conducted. Participants from a large online message board community who met up with an online acquaintance face-to-face completed surveys regarding their relationship with that individual before and after meeting their acquaintance face to face. Results indicated that the amount of communication with the online acquaintance was related to greater relation development whereas connection to the group was only related to greater individual closeness not satisfaction or predicted outcome value. In general the face-to-face meeting resulted in improved closeness, satisfaction, and predicted outcome value. An exploration for curvilinear effects as predicted by the hyperpersonal model revealed that predicted outcome value at time 1 had a curvilinear effect on closeness at time 2.     

Situational variables in online versus offline channel choice

Since the advent and rapid diffusion of the Internet, the subject of consumer channel choice has attracted a large amount of research, mainly focused on the influence of channel, consumer and product category characteristics as its drivers. The interaction between channel choice and the purchase situation has been largely ignored, however. This paper is an attempt to fill this gap by identifying the key purchase situation variables and conducting an experiment to assess their impact on the choice between the traditional retail outlet and the online store. The results show that the key determinants of channel choice relate to time and distance. Distance-to-store and time pressures are among the factors affecting the probability of online purchase. Using a conceptual framework to explore differences in the impact of situational variables across product categories (high/low involvement, search/experience good), we show that distance-to-store has more influence on the likelihood of online purchase in situations involving search goods, while social variables are found to play a role only in the context of high-involvement goods.