Text and Voice Integrated Paging System

In this paper,the key techniques and approaches to pragmatize text and voice integrated paging system are discussed. Based on the analyses, a 2 400 bps integrated experimental paging system fully compatible with POCSAG system is presented. The theory

Android平台大规模数据页面的设计与实现

随着移动应用的普及,Android平台上高效展示和管理大规模数据成为一项重大挑战。为了解决传统的数据页面设计在处理大规模数据时面临的数据加载速度慢、页面卡顿以及用户体验不佳等问题,提出了一种基于Paging库的Android平台数据页面设计与实现方法,并通过不同层次的测试验证了该方法的有效性,测试结果表明该方法能够显著提高数据浏览和搜索的效率,并提供良好的用户体验。

Guide For Authors

INTRODUCTION.Types of Contributions.Full-length/Research Article(Page limit:20).A complete report on original research,development,or application of control and machine learning methods.All the authors need to provide their biographies and personal photos.Submitted manuscripts should be nominally around 12 pages in Elsevier's double-column format,but no more than 20 pages(including bios and photos).

蜂窝物联网空口寻呼接入技术研究

针对在物联网和智慧城市应用中发现的大连接接入问题,利用蜂窝移动网络中的寻呼(Paging)技术解决终端海量准实时响应平台接入物联网问题,有效地降低终端的功耗并提高空口效率。寻呼是4G、5G、6G大连接重要技术之一。介绍如何采用寻呼技术系统满足平台与物联网终端实时通信需求。

Design and Realization of Cloth Order System on Mobile Internet

Based on the analysis of developing target, function and constitution of cloth order system under wap gateway, the mobile communication principle of cloth order system under wap gateway is given out. The implementation method for information communication of cloth order system are elaborated by using programming technology of active server page (ASP)3.0 and wireless markup language (WML). The browsing and inquiry of cloth information, sending and receiving of cloth order can be easily realized by the developed order system on mobile internet according to user’s requirements.

面向大数据管理决策研究的全景式PAGE框架

大数据和人工智能的飞速发展增加了管理决策领域的复杂性和动态性,也为研究和应用提供了广袤的拓新空间.全景式PAGE框架作为大数据管理决策研究的方向性框架,在大数据问题特征的映射下形成了一个4×3要素矩阵,在理论范式(P)、分析技术(A)、资源治理(G)、使能创新(E)的研究探索中发挥着重要作用.本文结合NSFC大数据重大研究计划的开展,进一步阐释全景式PAGE框架的内涵和关系逻辑,并面向领域情境讨论重要科学问题、求解路径和新知贡献.本文旨在从大数据管理决策研究的视角为大数据等颠覆性信息技术应用的相关研究提供前沿方向和创新突破上的启迪;同时为管理学科及其相关学科领域开展交叉属性强、应用情境差异化特点突出的科研攻关提供参考.

皂荚籽热风干燥特性及干燥动力学模型研究

目的研究皂荚籽干燥特性,为其机械化剥离应用提供理论参考。方法考察不同温度(70、90、110、130℃)与不同预处理方法(清水、碳酸氢钠溶液、焦磷酸二氢二钠溶液和酒石酸氢钾溶液浸泡)对皂荚籽干燥动力学的影响,使用Lewis模型、Page模型与Weibull分布函数对其干燥特性曲线进行非线性拟合并进行评价,计算皂荚籽干燥过程的有效水分扩散系数及其估算值与活化能,并通过响应面回归模型建立干燥动力学模型。结果皂荚籽的干燥过程中,干燥温度越高,干燥速率越快,预处理方法对其干燥速率有一定影响。Weibull分布函数能更好地模拟皂荚籽干燥过程。有效水分扩散系数及其估算值随着温度的升高而升高,经过酒石酸氢钠溶液预处理的皂荚籽的活化能低于其他预处理方法,可大大提高皂荚籽干燥效率。结论经碳酸氢钠溶液预处理的皂荚籽干燥较容易发生,Weibull函数能较好地描述皂荚籽干燥过程中水分含量的变化规律,酒石酸氢钠溶液可以降低皂荚籽的活化能。该研究可为皂荚籽干燥提供理论和技术基础。

Track Paging an Optimal Method for Minimizing Paging and Signaling Cost in Mobile IP

Mobile IP is an Internet standards protocol, which enhances the existing Internet Protocol (IP) to accommodate mobility. In mobile IP protocol, to find the exact location of mobile node for transferring incoming packets to them has a lot of signaling cost. So increasing the performance and decreasing the signaling cost are challenges of this protocol. Using the paging mechanism, its operation is in such a way that it can reduce Relocation update cost and save on power consumption in a mobile node. In addition, it can improve the performance of network by decreasing the need to register an idle mobile node. Mobile IP, currently does not support paging. Therefore, after introducing the mobile IP protocol and reporting related works, this paper will try to introduce a way to add paging support to the Mobile IP. Track paging is proposed to reduce the number of registration message of an idle mobile node to the mobile node’s home agent by waiving broad casting method and paging area size. Analytical results show that Track paging can significantly improve the total signaling cost of MIP vs. previous methods. Results also show that specifying the optimal paging area is critical in saving signaling cost of a MIP with paging support.

Nonhomogeneous Risk Rank Analysis Method for Security Network System

Security measures for a computer network system can be enhanced with better understanding the vulnerabilities and their behavior over the time. It is observed that the effects of vulnerabilities vary with the time over their life cycle. In the present study, we have presented a new methodology to assess the magnitude of the risk of a vulnerability as a “Risk Rank”. To derive this new methodology well known Markovian approach with a transition probability matrix is used including relevant risk factors for discovered and recorded vulnerabilities. However, in addition to observing the risk factor for each vulnerability individually we have introduced the concept of ranking vulnerabilities at a particular time taking a similar approach to Google Page Rank Algorithm. New methodology is exemplified using a simple model of computer network with three recorded vulnerabilities with their CVSS scores.

Implementation of an Available Parking Space Detection System in Hectic Parking Lots

Parking automation has been developed for locating available parking spaces inside a parking lot with new technologies, such as automatic collection, capacity, or empty spaces’ detection;to both reduce search time and avoid crowds of vehicles waiting to park in it. A simple detection system of available spaces, within the Faculty and Staff parking lot of the Engineering and Chemistry Departments at the Autonomous University of Chihuahua, Mexico (UACH), was set up. First, an analysis of vehicle capacity was carried out to establish the peak hours of vehicles’ entrances and compare it to the parking lots’ capacity. For one working week (6 days), it was determined that Tuesdays have the highest vehicle occupancy, and Saturdays are the days with the least traffic. Second, the geometric design of the parking lot (divided into two areas because of the terrain topography: upper and bottom levels), its dimensions and location of parking spots and marks on the pavement for traffic directions, were obtained from its blueprint, to visualize how the surveillance cameras can be oriented to cover the area. A detection system prototype was created for a specific area of the parking lot, using an artificial vision technique to perform the video extraction, while the digital image processing was developed in MATLAB. To complement and achieve the objective, Object- Oriented Programming (OOP) was used to obtain the count analysis as well as the availability/occupancy of each of the parking areas. This information is shown on a web page, with a simple driver-friendly design, since it has each parking space number and its availability in blue with the word “Available” or, in the opposite case, the word “Taken” in pink.

Paging Dr.Sun

One doctor’s story of struggle,resilience and happiness in the 1970s Tanzania SUN Jingling’s granddaughter has just moved to Africa. Bidding her adieu has made Sun wistful for her own youth 40 years past.Sun,a doctor,now 80 years old,worked as a medical volunteer in Zanzibar, Tanzania throughout the late 1960s and early 1970s. During her time in East Africa,she put in long hours and was deeply touched by the stories of the people around her.

Performance Framework for Virtual Machine Migration in Cloud Computing

In the cloud environment,the transfer of data from one cloud server to another cloud server is called migration.Data can be delivered in various ways,from one data centre to another.This research aims to increase the migration performance of the virtual machine(VM)in the cloud environment.VMs allow cloud customers to store essential data and resources.However,server usage has grown dramatically due to the virtualization of computer systems,resulting in higher data centre power consumption,storage needs,and operating expenses.Multiple VMs on one data centre manage share resources like central processing unit(CPU)cache,network bandwidth,memory,and application bandwidth.Inmulti-cloud,VMmigration addresses the performance degradation due to cloud server configuration,unbalanced traffic load,resource load management,and fault situations during data transfer.VMmigration speed is influenced by the size of the VM,the dirty rate of the running application,and the latency ofmigration iterations.As a result,evaluating VM migration performance while considering all of these factors becomes a difficult task.Themain effort of this research is to assess migration problems on performance.The simulation results in Matlab show that if the VMsize grows,themigration time of VMs and the downtime can be impacted by three orders ofmagnitude.The dirty page rate decreases,themigration time and the downtime grow,and the latency time decreases as network bandwidth increases during the migration time and post-migration overhead calculation when the VMtransfer is completed.All the simulated cases of VMs migration were performed in a fuzzy inference system with performance graphs.

Graph Ranked Clustering Based Biomedical Text Summarization Using Top k Similarity

Text Summarization models facilitate biomedical clinicians and researchers in acquiring informative data from enormous domain-specific literature within less time and effort.Evaluating and selecting the most informative sentences from biomedical articles is always challenging.This study aims to develop a dual-mode biomedical text summarization model to achieve enhanced coverage and information.The research also includes checking the fitment of appropriate graph ranking techniques for improved performance of the summarization model.The input biomedical text is mapped as a graph where meaningful sentences are evaluated as the central node and the critical associations between them.The proposed framework utilizes the top k similarity technique in a combination of UMLS and a sampled probability-based clustering method which aids in unearthing relevant meanings of the biomedical domain-specific word vectors and finding the best possible associations between crucial sentences.The quality of the framework is assessed via different parameters like information retention,coverage,readability,cohesion,and ROUGE scores in clustering and non-clustering modes.The significant benefits of the suggested technique are capturing crucial biomedical information with increased coverage and reasonable memory consumption.The configurable settings of combined parameters reduce execution time,enhance memory utilization,and extract relevant information outperforming other biomedical baseline models.An improvement of 17%is achieved when the proposed model is checked against similar biomedical text summarizers.

Weighted PageRank Algorithm Search Engine Ranking Model for Web Pages

As data grows in size,search engines face new challenges in extracting more relevant content for users’searches.As a result,a number of retrieval and ranking algorithms have been employed to ensure that the results are relevant to the user’s requirements.Unfortunately,most existing indexes and ranking algo-rithms crawl documents and web pages based on a limited set of criteria designed to meet user expectations,making it impossible to deliver exceptionally accurate results.As a result,this study investigates and analyses how search engines work,as well as the elements that contribute to higher ranks.This paper addresses the issue of bias by proposing a new ranking algorithm based on the PageRank(PR)algorithm,which is one of the most widely used page ranking algorithms We pro-pose weighted PageRank(WPR)algorithms to test the relationship between these various measures.The Weighted Page Rank(WPR)model was used in three dis-tinct trials to compare the rankings of documents and pages based on one or more user preferences criteria.Thefindings of utilizing the Weighted Page Rank model showed that using multiple criteria to rankfinal pages is better than using only one,and that some criteria had a greater impact on ranking results than others.

Homogeneous Batch Memory Deduplication Using Clustering of Virtual Machines

Virtualization is the backbone of cloud computing,which is a developing and widely used paradigm.Byfinding and merging identical memory pages,memory deduplication improves memory efficiency in virtualized systems.Kernel Same Page Merging(KSM)is a Linux service for memory pages sharing in virtualized environments.Memory deduplication is vulnerable to a memory disclosure attack,which uses covert channel establishment to reveal the contents of other colocated virtual machines.To avoid a memory disclosure attack,sharing of identical pages within a single user’s virtual machine is permitted,but sharing of contents between different users is forbidden.In our proposed approach,virtual machines with similar operating systems of active domains in a node are recognised and organised into a homogenous batch,with memory deduplication performed inside that batch,to improve the memory pages sharing efficiency.When compared to memory deduplication applied to the entire host,implementation details demonstrate a significant increase in the number of pages shared when memory deduplication applied batch-wise and CPU(Central processing unit)consumption also increased.

Guide For Authors

INTRODUCTION Types of Contributions Full-length/Research Article(Page limit:20)A complete report on original research,development,or application of control and machine learning methods.All the authors need to provide their biographies and personal photos.Submitted manuscripts should be nominally around 12 pages in Elsevier's double-column format,but no more than 20 pages(including bios and photos).

Ranking of Web Pages in a Personalized Search

The basic idea behind a personalized web search is to deliver search results that are tailored to meet user needs, which is one of the growing concepts in web technologies. The personalized web search presented in this paper is based on exploiting the implicit feedbacks of user satisfaction during her web browsing history to construct a user profile storing the web pages the user is highly interested in. A weight is assigned to each page stored in the user’s profile;this weight reflects the user’s interest in this page. We name this weight the relative rank of the page, since it depends on the user issuing the query. Therefore, the ranking algorithm provided in this paper is based on the principle that;the rank assigned to a page is the addition of two rank values R_rank and A_rank. A_rank is an absolute rank, since it is fixed for all users issuing the same query, it only depends on the link structures of the web and on the keywords of the query. Thus, it could be calculated by the PageRank algorithm suggested by Brin and Page in 1998 and used by the google search engine. While, R_rank is the relative rank, it is calculated by the methods given in this paper which depends mainly on recording implicit measures of user satisfaction during her previous browsing history.

Research on Teaching Reform of Web Design Course in Colleges and Universities

Web design is a key course for computer majors in colleges and universities,and it has the characteristics of comprehensiveness and practicability.In order to ensure the quality of web design teaching,teachers need to formulate appropriate teaching strategies in combination with teaching content and student characteristics.This paper summarizes the problems existing in the teaching of computer web design in colleges and universities,studies the effective strategies and related aspects of computer web design teaching in colleges and universities,and hopes to provide guidelines and information for relevant teachers.