Picosecond laser trimming of ceramic cores with porous multi-scale particle microstructure

The ceramic core, produced by hot injection molding, is one of the critical components for manufacturing high-performance aircraft engine turbine blades. However, the injection molding process will cause defects such as burrs and flashes in the fine structure of the formed ceramic core. Manual trimming is necessary, but the trimming quality is poor, and the yield is low. In this paper, the online trimming method of ceramic cores is studied. Based on the orthogonal experiment method, the optimal laser parameters for processing the ceramic core's porous multi-scale particle structure material were obtained. Further, the problems of the match head and tail phenomenon and dimensional accuracy improvement in trimming ceramic cores have been studied. A path optimisation method is proposed to improve the quality and accuracy of the trimming profile effectively. Finally, the overall process flow of ceramic core trimming is elaborated, and experimental verification is given. The results show that the ceramic core online trimming method proposed in this paper has advantages of high precision and high yield compared with the manual method, which will have substantial potential application value in the aviation field.     

Semantically enriched Massive Open Online Courses (MOOCs) platform

Massive Open Online Courses (MOOCs) are becoming an essential source of information for both students and teachers. Noticeably, MOOCs have to adapt to the fast development of new technologies; they also have to satisfy the current generation of online students. The current MOOCs’ Management Systems, such as Coursera, Udacity, edX, etc., use content management platforms where content are organized in a hierarchical structure. We envision a new generation of MOOCs that support interpretability with formal semantics by using the SemanticWeb and the online social networks. Semantic technologies support more flexible information management than that offered by the current MOOCs’ platforms. Annotated information about courses, video lectures, assignments, students, teachers, etc., can be composed from heterogeneous sources, including contributions from the communities in the forum space. These annotations, combined with legacy data, build foundations for more efficient information discovery in MOOCs’ platforms. In this article we review various Collaborative Semantic Filtering technologies for building Semantic MOOCs’ management system, then, we present a prototype of a semantic middle-sized platform implemented at Western Kentucky University that answers these aforementioned requirements.     

Fault handling in large water networks with online dictionary learning

Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks.     

Model checking temporal knowledge and commitments in multi-agent systems using reduction

Though modeling and verifying Multi-Agent Systems (MASs) have long been under study, there are still challenges when many different aspects need to be considered simultaneously. In fact, various frameworks have been carried out for modeling and verifying MASs with respect to knowledge and social commitments independently. However, considering them under the same framework still needs further investigation, particularly from the verification perspective. In this article, we present a new technique for model checking the logic of knowledge and commitments (CTLKC⁺). The proposed technique is fully-automatic and reduction-based in which we transform the problem of model checking CTLKC⁺ into the problem of model checking an existing logic of action called ARCTL. Concretely, we construct a set of transformation rules to formally reduce the CTLKC⁺ model into an ARCTL model and CTLKC⁺ formulae into ARCTL formulae to get benefit from the extended version of NuSMV symbolic model checker of ARCTL. Compared to a recent approach that reduces the problem of model checking CTLKC⁺ to another logic of action called GCTL¹, our technique has better scalability and efficiency. We also analyze the complexity of the proposed model checking technique. The results of this analysis reveal that the complexity of our reduction-based procedure is PSPACE-complete for local concurrent programs with respect to the size of these programs and the length of the formula being checked. From the time perspective, we prove that the complexity of the proposed approach is P-complete with regard to the size of the model and length of the formula, which makes it efficient. Finally, we implement our model checking approach on top of extended NuSMV and report verification results for the verification of the NetBill protocol, taken from business domain, against some desirable properties. The obtained results show the effectiveness of our model checking approach when the system scales up.     

Risk factors associated with online game addiction: A hierarchical model

Online gaming addiction has been increasingly recognized as a mental disorder. However, the predictive factors that lead to online gaming addiction are not well established. The aim of this study was to identify factors that may influence the development of online gaming addiction. A total of 263 patients with problematic online gaming addiction (255 males (97%) and 8 females (3%), age: mean = 20.4 ± 5.8 years) and153 healthy comparison subjects (118 males (77%) and 35 females (23%), age: 21.2 ± 5.5 years, range) were recruited for participation in the current study. Hierarchical logistic regression analyses among each set of variables were conducted. Individual factors (sex and age), cognitive factors (IQ and perseverative errors), psychopathological conditions (ADHD, depression, anxiety, and impulsivity), and social interaction factors (family environment, social anxiety, and self-esteem) were evaluated in a stepwise fashion. All four factors were associated with online gaming addiction, with psychopathological conditions being the strongest risk factors for the addiction. Individual factors, psychological factors, and social interactions were associated with the development of pure online gaming addiction. As before, psychological factors (attention, mood, anxiety and impulsivity) were the strongest risk factors for online gaming addiction in patients with pure online gaming addiction. Psychopathologies, including ADHD and depression, were the strongest factors associated with the development of online gaming addiction in individuals.     

Factors involved in associations between Facebook use and college adjustment: Social competence,perceived usefulness,and use patterns

Although previous research has investigated widespread use of social media, especially Facebook, by youth attending college, the conditions under which these media foster adjustment to college remain unclear. This study tested a model illuminating pathways linking social competence to college adjustment via students’ perceptions about the usefulness of Facebook and ways in which they used the medium. Self-report survey data from 321 college students (M age = 20.09; 58% female; 84% Caucasian) attending a major Midwestern university supported the proposed model, indicating that higher social competence could foster or impede college adjustment, depending upon how it was related to beliefs about the usefulness of different Facebook functions and how these perceptions, in turn, were associated with patterns of Facebook use. Findings underscore the importance of considering connections among personal attributes, perception of media effectiveness, and media behaviors in assessing the implications of social media for users’ psychosocial well-being.     

一种基于Normal基椭圆曲线密码芯片的设计

文章设计了一款椭圆曲线密码芯片。实现了GF（2^233）域上normal基椭圆曲线数字签名和认证。并支持椭圆曲线参数的用户配置。在VLSI的实现上，提出了一种新的可支持GF（2^233）域和GF（p）域并行运算的normal基椭圆曲线VLSI架构。其架构解决了以往GF（p）CA算迟后于GF（2^233）域运算的问题，从而提高了整个芯片的运算吞吐率。基于SMIC 0．18μm最坏的工艺，综合后关键路径最大时延3．8ns，面积18mm^2；考虑布局布线的影响，芯片的典型的情况下，每秒可实现8000次签名或4500次认证。     

CRL与OCSP相结合的证书撤销方案

提出了一个基于CRL和OCSP策略的新的证书撤销方案。首先分析比较了CRL和OCSP协议的优缺点,然后结合两者的优点通过建立一个请求处理服务器提出了一个新的证书撤销方案,最后对改进方案的优劣做了分析总结。     

Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

��Ȼ����������ϵͳ�ļ춨��У׼

当前我国管道天然气计量系以体积表示，就其计量器具而言，差压式流量计、容积式流量计和速变式流量计都有，但大流量计量大多仍采用标准孔板差压式流量计，其流量计量标准招待我国SY／T6143－1996《天然气流量的标准孔板计量方法》。文章介绍目前常用的三种流量计的优缺点比较；天然气标准孔板差压式流量计算机自动计量系统的检定，其中包括：标准孔板节流装置，静压、差压变送器、温度传感器、数据采集系统等组件的检定；以及计量器具的正确使用和维护。最后，文章指出目前流量计量的发展主要是二次仪表的发展，籍助应用计算机大大提高流量法的测量范围和准确度，但对用户来说，应选择性／价比合适的仪表，并要考虑所选用仪表要便于检定、维护，同时，计量检定部门则应跟上发展，为广大用户提供技术支持。