Lecture capture with real‐time rearrangement of visual elements: impact on student performance

The primary goal of this study is to create and test a lecture‐capture system that can rearrange visual elements while recording is still taking place, in such a way that student performance can be positively influenced. The system we have devised is capable of integrating and rearranging multimedia sources, including learning content, the instructor and students' images, into lecture videos that are embedded in a website for students to review after school. The present study employed a two‐group experimental design, with 153 participants (145 females and 8 males) making up an experimental group in which lecture courses were recorded using the new lecture‐capture system, and 149 participants (140 females and 9 males) forming a control group whose lectures were recorded by traditional means. All participants were in the freshman college and studying Introduction to Computer and Information Science in one of six classes, and were randomly assigned to one of the two groups. The participants' midterm examination and final examination scores were collected as indicators of their academic performance, with their mathematics entrance scores used as a pre‐test. The findings obtained from analysis of covariance (ANCOVA) suggest that appropriate rearrangement of visual elements in lecture videos can significantly impact students' learning performance.     

异构分层无线网络中基于逗留时间的动态流量均衡算法研究

为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高.     

Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

数据库新技术浅析

介绍了数据库技术的发展及现状，数据库技术与多学科技术的有机结合，根据数据库技术的延伸与发展，论述了数据库建设中应注意的几个问题。     

多业务移动通信系统中的呼叫接入控制

在多业务无线移动通信系统的呼叫接入控制中,不仅要考虑业务之间的优先级,同时也必须考虑切换呼叫的优先级。本文结合可移动边界算法和保护信道策略,提出了一种有效的多业务呼叫接入控制算法。为了方便地分析方案的性能,设计了一个二维的Markov链对方案的性能进行理论上的分析。通过数值分析结果表明,提出的算法同时保证了两种优先级,并提高了系统的性能。1     

移动通信系统"单通"故障浅析

重点分析了移动通信系统中,无线及交换系统内语音单通故障的成因；并以朗讯 CDMA 交换系统为例,提出语音系统优化建议；最后结合运维工作,阐述单通故障的处理流程与几种有效处理思路及工具。     

基于SIP的宽带实时多媒体通信研究与实现

介绍了会晤创建协议(SIP)，提出了基于SIP的应用系统——SRMCS，针对该实时多媒体通信系统，分析了其音频模块的实现和背景噪音的处理、视频模块的实现和视频的流畅播放，并就实时多媒体通信系统的关键问题——视、音频同步给出了可行的解决方案，最后还探讨了本系统中信令流和媒体流的传输方式。     

高速网络协议：问题与答案

作者在本文中指出了吉比特网络的目标及其所带来的问题，采用了提出问题并回答问题（或说明可能答案）的方法来阐明。     

A semantic modeling approach for image retrieval by content

We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.     

Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks

The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness.