A legal framework for online commercial arbitration in UAE: new fabric but old style!

Online Arbitration has increasingly become a popular method for the resolution of electronic commerce disputes due to its inexpensive, speedy, and global nature. However, this kind of arbitration may face many consumer and doctrinal problems that threaten the legal validity of its procedures in the digital world. This paper thus aims to explore whether or not there are any legal obstacles to the use of online arbitration or to the recognition and enforcement of online arbitral awards within the current legal framework in the United Arab Emirates. As such, this paper briefly discusses whether the formal requirements of validity are satisfied if the arbitration agreement is entered into electronically or if the arbitration proceedings are handled from start to finish in a computerized manner. Furthermore, this paper addresses whether or not there is any need to set up specific sets of rules for online arbitration.     

GearBi: Towards an online arbitration environment based on the design principles simplicity,awareness, orientation,and timeliness

Arbitration is a preferred method for the resolution of international business disputes. As of yet, most publications on online arbitration deal with legal issues. In this paper, we present an Online arbitration environment that we believe facilitates the participants in a meaningful way. Our assumption is that an ODR service should be easy to use (convenient), and at the same time provide meaningful support. More specifically we have paid attention to four criteria that we believe are important, viz. simplicity, awareness, orientation and timeliness. The online arbitration service is called GearBi.     

CCIPCA-OPCSC: An online method for detecting shared congestion paths

It is very useful to detect network paths sharing the same bottleneck for improving efficiency and fairness of network resource usage. Existing techniques have been designed to detect shared congestion between a pair of paths with a common source or destination point. And they are poor in scalability and not applicable to online detection. To cope with these problems, a novel method called CCIPCA-based Online Path Clustering by Shared Congestion (CCIPCA-OPCSC) is proposed to detect shared congestion paths, whose essence lies in the use of a novel eigenvector projection analysis (EPA). First, the delay measurement data of each path are mapped into a point in a new, low-dimensional space based on the correlation among paths reflected by the eigenvectors and eigenvalues in the process of PCA. In this new space, points are close to each other if the corresponding paths share congestion. CCIPCA is also introduced to compute the eigenvectors and eigenvalues incrementally. Second, the clustering analysis is applied on these points so as to identify shared congestion paths accurately. CCIPCA-OPCSC has low computational complexity and can fulfill the requirement of online detection. This method is evaluated by NS2 simulations and experiments on the PlanetLab testbed over the Internet. The results demonstrate that this novel method is feasible and effective.     

CNONIX标准符合性测试研究

CNONIX标准规范了图书出版行业在信息交互过程中的数据项及其格式,提高了数据质量和使用效率。为了保证第三方软件能够正确地生成符合CNONIX标准的XML文件以及检测一个XML文件是否符合CNONIX标准,提出了相关的标准符合性测试方法;对CNONIX标准中规定的元素属性进行了研究并且分析了其对测试用例的影响;设计了XML文件对于CNONIX标准符合性的检测规则;最后提供了一个应用实例对检测规则予以说明。     

网约车任务分配系统优化

网约车是一种广泛应用的共享移动应用, 其核心问题是将出租车请求分配给具有不同目标的司机, 尽管对网约车的任务分配进行了广泛的研究, 但在很大程度上忽视了司机之间收入的公平性, 由于优化视角的短视和分配技术的耗时, 先行者对网约车公平任务分配的研究在公平性、效用性方面还存在不足. 在本文中, 提出了公平分配学习(LAF)方法, 它既优化了效用又优化了公平性的高效任务分配方案, 采用强化学习以整体的方式进行分配, 并提出一套加速技术, 以实现大规模数据的快速公平分配. 实验结果表明, 公平分配学习方法在公平性、效用性和效率方面分别比现有水平高出86.7%、29.1%和797%.     

用户群体满意度最大化的Top-k在线服务评价

考虑用户评价准则不一致的在线服务评价通常以服务的完整排序作为评价结果,而不是选择出使用户群体满意度最大的Top-k在线服务集合,使评价结果难以满足Top-k在线服务评价场景的合理性和公平性需求.为此,提出了一种用户群体满意度最大化的Top-k在线服务评价方法.该方法首先定义用户群体满意度指标,以衡量选择的k个在线服务的合理性;其次,考虑用户评价准则不一致及用户偏好信息不完整的情况,采用Borda规则将用户对在线服务的偏好关系构造为用户-服务满意度矩阵;然后借鉴Monroe比例代表思想,将Top-k在线服务评价问题建模为寻找最大化用户群体满意度的在线服务集合的优化问题;最后采用贪心算法对该优化问题进行求解,将得到的在线服务集合作为Top-k评价结果.通过理论分析和实验验证了该方法的合理性和有效性.理论分析表明,该方法满足Top-k在线服务评价所需的比例代表性和公平性.同时,实验结果也表明,该方法能够在合理的时间内获得接近用户群体满意度理想上界的评价结果,可以有效地辅助用户群体做出正确的服务选择决策.另外,该方法还可以在用户偏好不完整的情况下实现Top-k在线服务评价.     

基于JSP技术的自动组卷与在线作业系统的设计与实现

网络考核是评价网络学习效果的一个重要环节,网络考核的实现基础是自动组卷技术。对于弥补学生课堂学习的疏漏和及时检验学生学习情况是一种行之有效的手段。在线作业技术将教师完全从手工批改作业中解放出来。探讨了以JDK1.6和Netbeans6.7作为开发平台的在线组卷和在线作业系统部分关键技术的设计与实现。     

可证安全的CLPKC-to-IDPKC在线/离线异构签密方案

在线/离线签密不仅可以提高移动设备的计算效率,而且还可以保证数据的机密性和不可伪造性。异构密码环境下,需要考虑不同公钥密码环境之间的在线/离线签密问题。定义了从无证书密码体制到身份密码体制的在线/离线异构签密安全模型,并提出了具体的CLPKC-to-IDPKC在线/离线异构签密方案。方案执行签密运算时,不需要双线性对运算;执行解签密时,只需要2个双线性对运算。与已有在线/离线异构签密方案相比,在效率相当的情况下不存在证书管理问题,适合于计算能力受限的移动设备。通过安全性证明本文方案满足机密性和不可伪造性。最后的实验仿真分析了所提方案在线/离线签密和解签密的效率,该方案采用了独立系统参数,更适用于实际应用环境。     

Efficient fair algorithms for message communication

A computer network serves distributed applications by communicating messages between their remote ends. Many such applications desire minimal delay for their messages. Beside this efficiency objective, allocation of the network capacity is also subject to the fairness constraint of not shutting off communication for any individual message. Processor Sharing (PS) is a de facto standard of fairness but provides significantly higher average delay than Shortest Remaining Processing Time (SRPT), which is an optimally efficient but unfair algorithm. In this paper, we explore efficient fair algorithms for message communication where fairness means that no message is delivered later than under PS. First, we introduce a slack system to characterize fair algorithms completely and develop efficient fair algorithms called Pessimistic Fair Sojourn Protocol (PFSP), Optimistic Fair Sojourn Protocol (OFSP), and Shortest Fair Sojourn (SFS). Then, we prove that a fair online algorithm does not assure minimal average delay attainable with fairness. Our analysis also reveals lower bounds on worst-case inefficiency of fair algorithms. We conduct extensive simulations for various distributions of message sizes and arrival times. During either temporary overload or steady-state operation, SFS and other newly proposed fair algorithms support SRPT-like efficiency and consistently provide much smaller average delay than PS.     

Consent for processing children’s personal data in the EU: following in US footsteps?

With the recent adoption of the General Data Protection Regulation (GDPR), the European Union (EU) assigned a prominent role to parental consent in order to protect the personal data of minors online. For the first time, the GDPR requires parental consent before information society service providers can process the personal data of children under 16 years of age. This provision is new for Europe and faces many interpretation and implementation challenges, but not for the US, which adopted detailed rules for the operators that collect personal information from children under the Children’s Online Privacy Protection Act (COPPA) almost two decades ago. The article critically assesses the provisions of the GDPR related to the consent of minors, and makes a comparative analysis with the requirements stipulated in the COPPA in order to identify pitfalls and lessons to be learnt before the new rules in the EU become applicable.     

两级循环优先算法在PCI仲裁器上的实现

循环优先仲裁算法具有现实公平的特点,介绍了两级循环优先仲裁算法,并给出了该算法在PCI总线仲裁器上的实现方案。将PCI总线主设备分为优先权不同的四个层次,通过对各层次总线主设备的检测实现仲裁。由于采用了设备申请号寄存器组记录总线状态,避免了复杂状态机的设计,该方案可灵活应用于不同数量设备的PCI系统,具有很好的可扩展性。     

基于多种规则的课程元数据自动抽取

在线课程组织和管理系统就是为了使学习更加便利而提供的一个教育资源的集成平台.作为系统中重要环节的元数据抽取模块,需要对半结构化网页能够达到较好的抽取精确性,并具有处理结构松散文档的能力.本文设计并实现了一种按照指定规则自动抽取的元数据方法.该方法能够按照多优先级规则匹配网页元数据.并按照两步抽取的方法进行精细化处理.针对不同的问题域使用不同规则抽取,不需对程序进行特定修改.实验证明,这种方法能够很好地处理半结构化网页,F测度达到85%以上,具有较好的实用价值.     

Online arbitration in the social network world; mobile justice on iPhones

Social networks are increasingly becoming important due to many aspects of everyday life supported and being facilitated through on-line activity. Billions of individuals are enjoying the use of social networks today and, therefore, they are becoming an important innovation in the modern world. However, due to disputes and concerns that are associated with such activities, the social networking world has yet to reach its full potential. When disputes occur in the on-line world, measures need be taken to settle those disputes in the same way that they were created. Through solving these disputes, the social networking world will be assisted in reaching full potential. One way of settling user disputes in the social networking world is the use of online arbitration. There are a number of advantages to using online arbitration as the parties involved will only communicate through the Internet and do not need to travel throughout the process. This helps in lowering the litigation costs to all parties involved. Considering the advantages online, arbitration has and the power that the social networking world bares, it is possible for users' disputes to be resolved and encourage communication between masses of users to build their confidence. With confidence that their disputes can be resolved easily, more users will be willing to publicise their profile for other users to view.     

行为时序逻辑中四级公平性下的活性推理规则

公平性是行为时序逻辑用于表达系统活性的形式,直接影响到系统描述的正确性与完整性,对其进行细化与完善能有效提高行为时序逻辑的系统描述能力。然而在对公平性进行细化的同时,却缺乏相应的、运用于性质验证的推理规则。针对这一问题,通过对公平性内涵的分析,给出了四级公平性体系下的活性推理规则,并分别进行了证明。作为示例,运用新的活性推理规则,对一个程序实例进行了推理验证。在建立起相应的活性推理规则后,四级公平性才能够被有效运用到实际的系统描述与验证中。     

网上证券交易系统的时序Petri网描述及验证

基于时序Petri网对我国现行网上静态和动态证券交易系统进行了模拟、形式描述及功能正确性验证.应用时序逻辑推理规则,从形式上严格证明了证券交易系统需求规范及其时序Petri网模型动态行为的一致性.结果表明,时序Petri网能够清楚而简单地描述事件间的因果关系和时序关系以及并发系统中某些与时间有关的重要性质,如最终性和公平性.因此,时序Petri网可作为并发系统形式化描述和分析的有力工具.     

在线百科间的标签推荐算法

信息社会中在线百科已成为人们获取知识的重要途径,而在线百科的标签系统作为其重要组成部分,不仅可以帮助人们在浏览某张页面时获取其他相关页面的信息,而且对于海量文本分类,以及提高在线百科检索系统的检索效率都有很大帮助。充分利用在线百科页面间的链接关系,提出了一种基于页面间的同质性原理和向量空间模型的全新针对在线百科的标签推荐算法HVSM(homogeneous principle based vector space model)。该标签推荐算法具有普适性,可在不同在线百科系统间推荐标签。实验结果表明,通过与朴素推荐算法NAM(nave recomm endation model)进行比较,新的推荐算法可以达到更高的准确率。并且通过对实验数据进行分析,得到了若干有益的结论,为今后的研究工作奠定了基础。     

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

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

基于用户业务量的在线计费方法研究

该文分析了相关研究工作,和现有在线计费系统中业务可用量分配方法存在的不足,提出了一种基于用户业务量的在线计费方法,基于用户历史业务使用量来分配业务可用量,用于在线计费系统中的用户业务可用量分配。仿真实验表明该方法分配的业务量能更贴近用户的业务使用习惯,从而有效提高了在线计费效率。     

基于FAHP的网络课程评价系统的开发与应用

网络课程评价是网络课程建设中的重要一环,为了对网络课程进行科学有效地评价,提高网络课程建设的效益,建立了基于模糊综合评价法和改进的层次分析法的网络课程评价模型。基于该模型在VC平台上设计并开发了网络课程的计算机评价支持决策系统,对系统的体系结构和关键技术进行了详细的说明。实例分析结果表明,该评价系统能够对网络课程进行科学的评价,并给出改进的合理、科学有效的建议,该系统具有较高的可行性、实用性,极大地提高了网络课程评价工作的效率。     

在线考试系统的设计与实现

计算机技术的发展,特别是网络技术的飞速发展,给人们的工作生活都带来了极大的方便,网上考试系统也开始受到人们的关注,并发挥着及其重要的作用。传统的考试方式已经不能适应现代考试的需要,人们迫切需要在线考试系统,以减轻教师的工作负担及提高工作效率,同时也可提高考试的质量,本文设计的在线考试系统充分利用了Brower／Server结构的特点,实现了将考试系统移植到Intemet的功能,该系统的优势在于极大的简化了老师出题的工作和学生考试的方式,做到了出题的多样性。