中职计算机技能大赛推进教学改革的研究

现在很多职业院校都参加了计算机技能大赛,如何通过技能大赛有效的推进职业教育教学改革,把在参加技能大赛中学习到的教学方法和经验有效的融入到日常教学改革中,是广大职业教育工作者急需面对和解决的一个问题。通过分析计算机技能大赛对计算机教学改革的推进作用,对中职计算机教学改革进行了研究。     

凸显计算机专业特色的离散数学教学研究与实践

离散数学是计算机专业的一门重要基础课,对离散数学的教学研究一直是从事计算机教育工作者关注的热点。文章提出在计算机专业离散数学的教学过程中,教师应避免将该课程讲成一门数学理论课,而是对每一部分应结合计算机领域的相关实际应用背景进行阐述与引入,提高教学的针对性,从而调动学生学习积极性,促进教学质量的提高。     

基于多线程的音频设备上位机控制系统

设计一种音频设备的上位机控制系统,实现对多台音频设备的集中和远程控制。为了保证上位机在与设备通信的同时,能及时响应前台界面的用户操作,引入了多线程技术。同时,音频设备具有经常被持续、快速调节同一参数的特点,为解决在此情况下由于硬件通信速度有限而导致的设备滞后响应上位机用户操作的问题,设计了一种冗余命令剔除机制。该机制不仅有效地减少了通信占用的资源,而且更好地保证了用户对设备调节控制的实时性。     

An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities

In this paper, we investigate an inexact hybrid projection-proximal method for solving a class of generalized mixed variational inequalities in Hilbert spaces. We construct a general inexact hybrid projection-proximal point algorithm, in which an inexact relaxed proximal point step is followed by a suitable orthogonal projection onto a hyperplane. Under some suitable conditions concerned with the pseudomonotone set-valued mapping T, the nonsmooth convex function f and the step size λ_k, we prove the convergence of the inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities in Hilbert spaces.     

Global Interoperability Using Semantics, Standards, Science and Technology (GIST)

“Global Interoperability Using Semantics, Standards, Science and Technology” is a concept that is predicated on the assumption that the semantic integration, frameworks and standards that support information exchange, and advances in science and technology can enable information-systems interoperability for many diverse users. This paper recommends technologies and approaches for enabling interoperability across a wide spectrum of political, geographical, and organizational levels, e.g. coalition, federal, state, tribal, regional, non government, and private. These recommendations represent steps toward the goal of the Semantic Web, where computers understand information on web sites through knowledge representations, agents, and ontologies.     

Methods for evaluating volunteers’ contributions in a deforestation detection citizen science project

Today, due to the availability of free remote sensing data, efficient algorithms for image classification and increased connectivity and computing power, together with international policy initiatives, such as the United Nations Programme on Reducing Emissions from Deforestation and Forest Degradation (UN-REDD), more and more countries are investing in their own national forest monitoring schemes. However, tropical forests remain under threat worldwide. Recently, a citizen science project that enables citizens around the globe to be involved in forest monitoring tasks has been proposed, called “ForestWatchers” (www.forestwatchers.net). Its main goal is to allow volunteers (many of them with no scientific training) around the globe, with their own smartphones, tablets and notebooks, review satellite images of forested regions and confirm whether automatic assignments of forested and deforested regions are correct. Inspected images are then sent to a central database where the results are integrated to generate up-to-date deforestation maps. This approach offers a low-cost way to both strengthen the scientific infrastructure and engage members of the public in science. Here, we describe the methods developed within the scope of the ForestWatchers project to assess the volunteers’ performance. These tools have been evaluated with data of two of the project’s preliminary tasks. The first, called “BestTile”, asks volunteers to select which of several images of the same area has the least cloud cover, while in the second, called “Deforestation”, volunteers draw polygons on satellite images delimiting areas they believe have been deforested. The results from more than 500 volunteers show that using simple statistical tests, it is possible to achieve a triple goal: to increase the overall efficiency of the data collecting tasks by reducing the required number of volunteers per task, to identify malicious behavior and outliers, and to motivate volunteers to continue their contributions.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Necessary optimality conditions for fuzzy variational problems

The main aims of this study are to derive the fuzzy Euler-Lagrange conditions for both fuzzy unconstrained and constrained variational problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its α-level sets.     

Strong stability of the mono-tubular heat exchanger equation with output feedback

We investigate asymptotic behavior of the C₀-semigroup T(t) associated with the mono-tubular heat exchanger equation with output feedback by a perturbation method. It is shown that T(t) is bounded if a constraint is satisfied by the parameters and the spatial distribution function. Further, applying the Arendt-Batty-Lyubich-Vu theorem, a criterion is established to judge strong stability of T(t).     

Multi‐agent collaboration based on enhanced cognitive awareness: an architecture for agents' profiling on the semantic web

This paper applies cognitive models, inspired by cognitive science, with the aim to propose architectural and knowledge‐based requirements to structure ontological models for the cognitive profiling of agents. The proposed architecture aims to address the lack of flexibility that most agent‐based collaborations are affected by. The resulting agents, equipped with advanced cognitive profiling, have an increased cognitive awareness of themselves and are more capable of interacting with other agents in a multi‐agents based environment. In this research, cognitive awareness identifies the ability of the web agents to diagnose their processing limitations and to establish interactions with the external environment. The outcome is the enhanced flexibility, reusability and predictability of the agent behaviour; thus contributing towards minimizing human cognitive demands. The concept of cognitive profiling presented in this paper considers the semantic web as an action mediating space, where ontological models provide affordances for improving cognitive awareness through shared knowledge‐base. The conceptual model for the cognitive profile architecture is developed with Protégé Ontology editor to generate OWL Ontology and evaluated through a proof of concept. The results show that agents equipped with cognitive awareness can undertake complex tasks more dynamically.