Modeling War as a Business Process with the Assistance of Service Oriented Architecture

The pace of war is increasing since militaries are adopting the ideas of NCW （network centric warfare）. Therefore, the process of war has to be modeled into the BP （business process） in order to benefit from available resources in real-time. There is an increasing need to automate command and control tools utilized in military operations because of the versatility and increase d tempo of operations. Operations can be commanded and orchestrated with the assistance of SOA （service oriented architecture）. SOA is currently seen as a technology that can satisfy these needs of NCO （network centric operations）. The BPs are chains of logic that request SOA services. This paper argues that in the case of a military setting, in order to achieve maximum impact with minimal effort （cf. downsizing）, military operations need to be modeled as BPs （e.g., a dismounted company attack）. This asks for using a RM （resource manager）, a scheduler and a BSS （battle secure scheduler） in allocating the requested services （e.g., processing a fire support order）. In the future, a single FFW （future force warrior）, an essential performer in military operations, can benefit from the BPs approach via enhanced performance, improved SA （situational awareness） and with decreased instances of fratricide. This introduced model examines war as a business process with the assistance of SOA and discusses how a business process--like orchestration of systems and services can improve the overall performance in given military settings.     

一种面向服务、事件驱动的企业应用动态联盟构造方法

提出了一种面向服务、事件驱动的企业应用动态联盟构造方法,旨在应对企业动态联盟中合作伙伴的动态选择和自主加入带来的信息系统动态集成问题．该方法通过业务事件表达联盟成员之间的业务需求,在各企业信息系统之间搭建了语义互通的桥梁;同时将基于主题和内容的事件发布／订阅机制引入其中,给出了基于订阅方式的合作伙伴及服务查找算法,以解决潜在合作伙伴的准确和动态查找问题;在合作伙伴的选择方面,通过基于协商的方式解决了联盟成员的自主加入问题．文中讨论了该方法的核心概念、工作原理以及相应的合作伙伴查找算法．给出了基于JMS消息服务以及消息队列服务的具体实现．该方法在某企业的动态供应链管理系统中得到了实际应用．     

A Pilot Study on the Service Design in Taipei Cloud Based on Time-Geography

To increase the quality of her service, in 2013, Taipei City implemented an enhanced web service called ＂Taipei Cloud＂ in order to create public and free Wi-Fi hotspots throughout the city. This pilot study explores user experience and their perception of ＂Taipei Cloud＂ based on subject-participants＇ observations, hoping to understand whether ＂Taipei Cloud＂ meet people＇s daily demands. Six subjects use ＂Taipei Cloud＂ randomly to obtain their cloud data through their smart phones during their trips. To analyze, time-geography theory is applied to evaluate the subjects＇ use of the service. The findings show that： （l） there is no direct correlation between time and space factors with regard to the subjects＇ access to the Citizen Cloud service; （2） because of its convenience, subjects consider contacting others and sharing should be a standard feature in the Citizen Cloud; （3） while comparing subjects＇ use of Citizen Cloud, ＂command＂ is more popular than other online features; （4） in their overall experience, subjects prefer higher interaction with cloud computing service.     

Algorithms for checking channel passing in web service choreography

Web service choreography describes global mod- els of service interactions among a set of participants. For an interaction to be executed, the participants must know the required channel（s） used in the interaction, otherwise the ex- ecution will get stuck. Since channels are composed dynami- cally, the initial channel set of each participant is often insuf- ficient to meet the requirements. It is the responsibility of the participants to pass required channels owned （known） by one to others. Since service choreography may involve many par- ticipants and complex channel constraints, it is hard for de- signers to specify channel passing in a choreography exactly as required. We address the problem of checking whether a service choreography lacks channels or has redundant chan- nels, and how to automatically generate channel passing based on interaction flows of the service choreography in the case of channel absence. Concretely, we propose a sim- ple language Chorc, a channel interaction sub-language for modeling the channel passing aspect of service choreography. Based on the formal operational semantics of Chore, the algo- rithms for static checking of service choreography and gen- erating channel passing are also studied, and the complexity results of algorithms are discussed. Moreover, some illus- trated service choreography examples are presented to show how to formalize and analyze service choreography with channel passing in Chorc.     

A hybrid distributed-centralized conflict resolution approach for multi-aircraft based on cooperative co-evolutionary

Conflict resolution （CR） plays a crucial role in safe air traffic management （ATM）. In this paper, we propose a new hybrid distributed-centralized tactical CR approach based on cooperative co-evolutionary named the CCDG （cooperative co-evolutionary with dynamic grouping） strategy to overcome the drawbacks of the current two types of approaches, the totally centralized approach and distributed approach. Firstly, aircraft are divided into several sub-groups based on their interdependence. Besides, a dynamic grouping strategy is proposed to group the aircraft to better deal with the tight coupling among them. The sub-groups are adjusted dynamically as new conflicts appear after each iteration. Secondly, a fast genetic algorithm （GA） is used by each sub-group to optimize the paths of the aircraft simultaneously. Thirdly, the aircraft＇s optimal paths are obtained through cooperation among different sub-groups based on cooperative co-evolutionary （CC）. An experimental study on two illustrative scenarios is conducted to compare the CCDG method with some other existing approaches and it is shown that CCDG which can get the optimal solution effectively and efficiently in near real time, outperforms most of the existing approaches including Stratway, the fast GA, a general evolutionary path planner, as well as three well-known cooperative co-evolution algorithms.     

Voice conversion towards modeling dynamic characteristics using switching state space model

In the literature of voice conversion （VC）, the method based on statistical Gaussian mixture model （GMM） serves as a benchmark. However, one of the inherent drawbacks of GMM is well-known as discontinuity problem, which is caused by transforming features on a frame-by-frame basis, thus ignoring the dynamics between adjacent frames and finally resulting in degraded quality of the converted speech. A variety of algorithms have been proposed to overcome this deficiency, among which the state space model （SSM） based method provides some promising results. In this paper, we proceed by presenting an enhanced version of the traditional SSM, namely, the switching SSM （SSSM）. This new structure is more flexible than the conventional one in that it allows using mixture of components to account for the rapid transitions between neighboring frames. Moreover, physical meaning of the model parameters of SSSM has been examined in depth, leading to efficient application-specific training and transforming procedures of VC. Experiments including both objective and subjective measurements were conducted to compare the performances of the conventional and the proposed SSM-based methods, which have convinced that obvious improvements in both aspects of similarity and quality can be obtained by SSSM.     

Performance Evaluation of Quicksort with GPU Dynamic Parallelism for Gene-Expression Quantile Normalization

High-density oligonucleotide microarrays allow several millions of genetic markers in a single experiment to be observed. Current bioinformatics tools for gene-expression quantile data normalization are unable to process such huge data sets. In parallel with this reality, the huge volume of molecular data produced by current high-throughput technologies in modern molecular biology has increased at a similar pace, challenging our capacity to process and understand data. On the other hand, the arrival of CUDA （compute unified device architecture） has unveiled the extraordinary power of GPUs （graphics processing units） to accelerate data intensive general purpose computing more and more as time goes by. In this work, we have evaluated the use of dynamic parallelism for ordering gene-expression data, where the management of kernels launching can be done not only by the host, but also by the device. Each sample has more than 6.5 million genes. We optimized the Quicksort parallel implementation available in the CUDA-5.5 Toolkit Samples and compared the performance of the sequential Quicksort algorithm from the GNU C Library （glibc） and with the parallel radix sort implementation available in the CUDPP-2.1 library. The Quicksort parallel implementation is designed to run on the GPU Kepler architecture, which supports dynamic parallelism. The results show that in the studied application the GPU parallel version with dynamic parallelism attains speed-ups in the data-sorting step. However, to achieve an effective overall speed-up considering the radix sort algorithm, performance of the whole application needs further optimizations.     

Flying Platform Tracking for Microwave Air-Bridging in Sky-Net Telecom Signal Relaying Operation

The Sky-Net project proposes a mobile BTS （base transceiver station） for mobile communication service from flying platform. An MAB （microwave air-bridging） is established in order to relay the telecom signal via airborne e-Cell BTS on flying platform. The QoS （quality of service） and data-link stability are highly concerned in Sky-Net system, and therefore, a two-axis antenna tracking mechanism is applied for keeping the directional antenna well aligned to flying platform. The proposed G2G （GPS-to-GPS） tracking algorithm is a simple but efficient method to calculate instant azimuth/elevation angle of flying platform related to ground tracking unit. Goal for this paper tries to reduce the vector error and maintain system bandwidth of MAB for telecom signal relaying in Sky-Net application.     

Biped walking on level ground with torso using only one actuator

It is well known that a biped robot needs actuators to walk stably on level ground. Till now, a biped robot with torso has needed at least two actuators to achieve this. Would it be possible for this kind of robot to walk on level ground with only one actuator？ This paper responds in the affirmative and proposes a simple control strategy for a planar biped robot with torso. In this control method, there is only one low gain proportional-derivative （PD） controller between the torso and the stance leg, while the swing leg remains totally free. The PD controller utilizes states of both the torso （angle and angular velocity） and the stance leg. The numerical simulations show that, by adopting this controller, a planar biped robot with torso can walk stably on level ground, and that the robot can walk with a wide range of speeds and high energy efficiency by changing the control parameters. Four period-one gaits, one of which is stable while the other three are unstable, are found by simulations. According to the literature surveyed, we are the first to have a torso only driven biped robot walk stably on level ground.     

Performance Evaluation of a Markovian Policy for Macro/Femto User Allocation Considering Aspects of QoS,QoE and Energy Efficiency

The advancement of wireless networks offers mobile users a diversity connectivity options, but the choice of the best connection should consider classics QoS aspects and, with increasing multimedia applications, should also consider QoE metrics. Another important parameter to choose the best connection is the energy efficiency by reducing the battery consumption of the devices and reducing CO2 emissions （green network）. This paper validates a Markovian policy for distribution of user load balancing in femtocell/macrocell networks considering QoS/QoE and energy consumption providing quality for multimedia applications. The results obtained by simulation proved the benefits.     

An automatic subdigraph renovation plan for failure recovery of composite semantic Web services

A Web service-based system never fulfills a user＇s goal unless a failure recovery approach exists. It is inevitable that several Web services may either perish or fail before or during transactions. The completion of a composite process relies on the smooth execution of all constituent Web services. A mediator acts as an intermediary between providers and consumers to monitor the execution of these services. If a service fails, the mediator has to recover the whole composite process or else jeopardize achieving the intended goals. The atomic replacement of a perished Web service usually does not apply because the process of locating a matched Web service is unreliable. Even the system cannot depend on the replacement of the dead service with a com- posite service. In this paper, we propose an automatic renova- tion plan for failure recovery of composite semantic services based on an approach of subdigraph replacement. A replacement subdigraph is posed in lieu of an original subdigraph, which includes the failed service. The replacement is done in two separate phases, ofltine and online, to make the recovery faster. The ofitine phase foresees all possible subdigraphs, pre-calculates them, and ranks several possible replacements. The online phase compensates the unwanted effects and executes the replacement subdigraph in lieu of the original subdigraph. We have evaluated our approach during an experiment and have found that we could recover more than half of the simulated failures. These achievements show a significant improvement compared to current approaches     

Path Loss Modelling for Location Service Applications

The aim of this paper is the path loss modelling for the radiolocation services in radio communication networks, particularly in cellular networks. The main results of the measurements obtained in the physical layer of the UMTS are introduced. A new method for the utilization of the multipath propagation phenomenon to improve the estimation of the distance between the MS （mobile station） and the BS （base station） is outlined. This method significantly increases the quality of location services in systems which use a radio interface with DS （direct sequence） CDMA （code division multiple access）.     

Inter-MAC Green Path Selection for Heterogeneous Networks

Gigabit home networks represent a key technology to make the Future Internet success a reality. Consumers will require networks to be simple to install, without the need of any new wire and with green consideration. To make this network ubiquitous, seamless and robust, a technology independent MAC layer will ensure its global control and provide connectivities to any number of devices the user wishes to connect to it in any room. In order to make this vision comes true, substantial progress is required in the fields of protocol design and in systems architectures. For this goal, we introduce a new convergence layer denoted inter-MAC, which provides a common infrastructure to the home network, Among the inter-MAC functionalities, we focused the interest on the path selection mechanism including the green aspect. To improve quality of service, reduce energy consumption and radiofrequency devices number, we define a new path selection protocol based on several metrics. We present some preliminary results obtained on an experimental test bed.     

DNA-chip-based dynamic broadcast encryption scheme with constant-size ciphertexts and decryption keys

In this paper we present DNA-DBE,a DNA-chip-based dynamic broadcast encryption scheme.In our scheme,new users can join dynamically without modification of other users’decryption keys.Either the ciphertext or the decryption key is of constant-size.Backward secrecy is achieved in DNA-DBE:if new users join the system dynamically,they will not be able to retrieve past data.The security of our scheme relies on hard biological problems,which are immune to attacks of new computing technologies in the future.There exists a special feature in DNA–based cryptosystems,i.e.the set of encryption keys and the set of decryption keys have a many-to-many relationship.The implementation of more complicated DNA cryptosystems taking advantage of this special feature has been previously left as an open problem.Our DNA-DBE system is a solution to this open problem,which is also the first exploration of DNA based group-oriented encryption system.     

动态网络环境下的透明服务组合

动态网络环境(如网格、Ad Hoc Wireless Network等)使面向服务的应用面临许多新问题.如何使用户能够透明、动态地按需使用各种服务是其中的研究热点之一.文中提出了一种虚拟服务模型,在此基础上定义了虚拟服务的组合运算,给出了服务动态查找的算法.此外,文中还介绍了支持虚拟服务透明组合的P2P服务组合原型系统,并在实验基础上对虚拟服务及其支撑引擎进行了客观评价.实验表明,该文所述虚拟服务及支撑引擎能使面向服务应用较好地适应动态网络环境下的服务变化,使用户能够透明地按需使用各种资源.     

Web Block Extraction System Based on Client-Side Imaging for Clickable Image Map

We propose a new Web information extraction system. The outline of the system and the algorithm to extract information are explained in this paper. A typical Web page consists of multiple elements with different functionalities, such as main content, navigation panels, copyright and privacy notices and advertisements. Visitors to Web pages need only a little of the pages. A system to extract a piece of Web pages is needed, our system enables users to extract Web blocks only by setting clipping areas with their mouse. Web blocks are clickable image maps. Imaging and detecting hyperlink areas on client-side are used to generate image maps. The specialty of our system is that Web blocks perfect layouts and hyperlinks on the original Web pages. Users can access and manage their Web blocks via Evernote, which is a cloud storage system. And HTML snippets for Web blocks enable users to easily reuse Web contents on their own Web site.     

面向服务网格的虚拟环境部署运行管理系统

虚拟技术的最新进展为网格计算提供了封装资源的新方式,其封装性、隔离性和安全性能够有效屏蔽底层资源的异构性,根据用户应用需求定制执行环境,更好地适应于网格环境的复杂性和应用的多样性。为了满足当前服务网格的需求发展,基于新的虚拟机技术,研究适合于服务网格的虚拟环境部署运行管理系统,该系统为用户提供可视化、易操作的远程虚拟环境部署和运行管理功能;并实现一个标准的网格服务,结合服务网格平台CROWN,该服务可根据用户应用的特定需求动态透明地部署虚拟执行环境,并根据资源状态自适配调度执行用户任务。并对系统进行了实验分析,实验结果验证了系统的良好可用性和运行性能。     

Regression-based resource provisioning for session slowdown guarantee in multi-tier Internet servers

Autonomous management of a multi-tier Internet service involves two critical and challenging tasks, one understanding its dynamic behaviors when subjected to dynamic workloads and second adaptive management of its resources to achieve performance guarantees. We propose a statistical machine learning based approach to achieve session slowdown guarantees of a multi-tier Internet service. Session slowdown is the relative ratio of a session’s total queueing delay to its total processing time. It is a compelling performance metric of session-based online transactions because it directly measures user-perceived relative performance and it is independent of the session length. However, there is no analytical model for session slowdown on multi-tier servers. We first conduct training to learn the statistical regression models that quantitatively capture an Internet service’s dynamic behaviors as relationships between various service parameters. Then, we propose a dynamic resource provisioning approach that utilizes the learned regression models to efficiently achieve session slowdown guarantee under dynamic workloads. The approach is based on the combination of offline training and online monitoring of the Internet service behavior. Simulations using the industry standard TPC-W benchmark demonstrate the effectiveness and efficiency of the regression based resource provisioning approach for session slowdown oriented performance guarantee of a multi-tier e-commerce application.     

Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition

This paper investigates the transition function and the reachability conditions of finite automata by using a semitensor product of matrices, which is a new powerful matrix analysis tool. The states and input symbols are first expressed in vector forms, then the transition function is described in an algebraic form. Using this algebraic representation, a sufficient and necessary condition of the reachability of any two states is proposed, based on which an algorithm is developed for discovering all the paths from one state to another. Furthermore, a mechanism is established to recognize the language acceptable by a finite automaton. Finally, illustrative examples show that the results/algorithms presented in this paper are suitable for both deterministic finite automata （DFA） and nondeterministic finite automata （NFA）.     

Validating Academic Training versus Organizational Training： An Analysis in the Enterprise Resource Planning （ERP） Field

ERP （enterprise resource planning） systems are packaged software applications that support most of an organization＇s informational needs within and across functional areas of the organization. Modern ERP systems serve as the foundation for a wide range of e-business models within one company, as well as throughout the value chain. This study explored industry ERP training of employees new to ERP, and compared this latter group to college students prepared with ERP skills from a college ERP class. The students remotely accessed the ERP systems featured here for class requirements. University and industry collaborations allow for a hands-on experience in the classroom that replicates industry applications by using real world tools. This synergistic relationship provides opportunities for students to acquire knowledge using a tangible tool that imitates what is utilized in the industry. The study noted that schools supported by several ERP vendor initiatives are increasingly integrating enterprise systems in their curricula. The resultant data identifies pertinent information that businesses consider valuable in their employees＇ ERP training. This noteworthy correlation, between college prepared students and employees new to ERP who have gone through ERP training, examined case studies of students who are now in the workforce. This study exposes these students＇ distinct advantage because of their ERP learning experience, and compares it to companies＇ ERP training practices. The intent, as in any educational environment, is not only to help students attain an understanding of the material, but to also master that material in the environment in which they will be required to use it.