摘要：The transmission capacity of Mobile Ad Hoc Networking (MANET) is constrained by the mutual interference of concurrent transmissions between nodes. First, the transmission capacity of MANET is studied by the view of information flow between nodes. At the same time, the problem that the interference between nodes affects the transmission capacity of MANET is also studied by the tool of the event conflict graph. Secondly, the paper presents the method to compute the maximum ex- pectant achievable capacity for the given conflict graph, and concludes and proves an sufficient con- dition that the information flow transmit successfully between nodes. At last, the results are simulated and a fitting equation of transmission capacity between nodes is given.

摘要：In this paper, an efficient technique for optimal design of digital infinite impulse response （IIR） filter with minimum passband error （ep）, minimum stopband error （es）, high stopband attenuation （As）, and also free from limit cycle effect is proposed using cuckoo search （CS） algorithm. In the proposed method, error function, which is multi-model and non-differentiable in the heuristic surface, is constructed as the mean squared difference between the designed and desired response in frequency domain, and is optimized using CS algorithm. Computational efficiency of the proposed technique for exploration in search space is examined, and during exploration, stability of filter is maintained by considering lattice representation of the denominator polynomials, which requires less computational complexity as well as it improves the exploration ability in search space for designing higher filter taps. A comparative study of the proposed method with other algorithms is made, and the obtained results show that 90% reduction in errors is achieved using the proposed method. However, computational complexity in term of CPU time is increased as compared to other existing algorithms.

摘要：As ubiquitous sensor networks (USN) technologies and its middleware are still at its early stages, the system of the USN relies on the middleware and applications. The past sensor networks are assumed to be designed for specific applications, having data communication protocols tightly coupled to applications. To avoid these problems, several kinds of USN middleware have been researched and developed. However, most middleware of USN are still restricted by its own infrastructure so far. This paper proposes appropriate 3 tier Smart Middleware System (3SMS) for USN.

摘要：By studying the core algorithm of a three-dimensional discrete wavelet transform(3-D DWT)in depth,this paper divides it into three one-dimensional discrete wavelet transforms(1-D DWTs).Based on the implementation of a 3-D DWT software,a parallel architecture design of a very large-scale integration(VLSI)is *** needs three dual-port random-access memory(RAM)to store the temporary results and transpose the matrix,then builds up a pipeline model composed of the three 1-D *** the design,the finite state machine(FSM)is used well to control the *** with the serial mode,the experimental results of the post synthesized simulation show that the design method is correct and *** can increase the processing speed by about 66%,work at 59 MHz,and meet the real-time needs of the video encoder.

摘要：A new multi-species particle swarm optimization with a two-level hierarchical topology and the orthogonal learning strategy(OMSPSO) is proposed, which enhances the global search ability of particles and increases their convergence rates. The numerical results on 10 benchmark functions demonstrated the effectiveness of our proposed algorithm. Then, the proposed algorithm is presented to design a butterfly-shaped microstrip patch antenna. Combined with the HFSS solver, a butterfly-shaped patch antenna with a bandwidth of about 40.1% is designed by using the proposed OMSPSO. The return loss of the butterfly-shaped antenna is greater than 10 d B between 4.15 and 6.36 GHz. The antenna can serve simultaneously for the high-speed wireless computer networks(5.15–5.35 GHz) and the RFID systems(5.8 GHz).

摘要：The Open Service Gateway Initiative (OSGi) has played an important role in ubiquitous environments that support interoperability among embedded devices, such as home appliances and network devices. However, the OSGi does not have a common event mechanism yet, and it is difficult to communicate among services asynchronously. In the present work, a common event manager, Aspect-Oriented Event Manager (AOEM), was designed on an OSGi framework. AOEM supports services to generate and provide notification of events. This paper presents the implementation of AOEM as an OSGi bundle with AspectJ. The experiment on transferring between device service and application service demonstrate that AOEM provides good abstraction of the services and convenience.

摘要：The aging society will become a serious problem for most countries in the world. Under the constraint of limited medical resource, the self-health management becomes important. In this paper, a mobile healthcare system is implemented. One can easily monitor his/her physiological data through the using of a smartphone that is wirelessly connected to different medical detection devices. A cloud database is established for storing and analysing these physiological data. The guidance of suitable physical exercises to individuals is then given in the system. This paper shows the details of the system implementation.

摘要：In this paper we describe how the test design can be done by using the Combinatorial Testing approach for internet of things operating systems. Contiki operating system is taken as a case study but we discuss what can be the approach for RIOT and Tiny OS operating systems. We discuss how the combinatorial coverage measurement can be gathered in addition to the traditional metrics code coverage. The test design generated by using Advanced Combinatorial Testing for Software is analyzed for Contiki operating system. We elaborate the code coverage gathering technique for Contiki simulator which happens to be in Java. We explain the usage of Combinatorial Coverage Measurement tool. Although we have explained the test design methodology for internet of things operating systems, the approach explained can be followed for other open source software.

摘要：The standard software development life cycle heavily depends on requirements elicited from stakeholders. Based on those requirements, software development is planned and managed from its inception phase to closure. Due to time and resource constraints, it is imperative to identify the high-priority requirements that need to be considered first during the software development process. Moreover, existing prioritization frameworks lack a store of historical data useful for selecting the most suitable prioritization technique of any similar project domain. In this paper, we propose a framework for prioritization of software requirements, called Re Pizer, to be used in conjunction with a selected prioritization technique to rank software requirements based on defined criteria such as implementation cost. ReP izer assists requirements engineers in a decision-making process by retrieving historical data from a requirements repository. Re Pizer also provides a panoramic view of the entire project to ensure the judicious use of software development resources. We compared the performance of Re Pizer in terms of expected accuracy and ease of use while separately adopting two different prioritization techniques, planning game（PG） and analytical hierarchy process（AHP）. The results showed that Re Pizer performed better when used in conjunction with the PG technique.

摘要：In this paper the author describes a heuristi-based algorithm for the faculty assignment problem. The algorithm was designed and implemented as part of a graduation project in the IT department of King Saud University, Riyadh, Saudi Arabia. The purpose of the project was to automate the manual tedious process of assigning TAs (teaching assistants) to suitable lab sessions, a task that needs to be done every semester in the IT department. The algorithm was designed to fulfill the assignment task while taking into consideration a number of constraints pertaining to both the TAs (e. g. personal preference and available hours) and the IT department (e. g. maximum allowed workload). The problem definition, the algorithm and the experimental results are thoroughly explained in this paper. The computational experimentation indicates the efficiency of the proposed algorithm in assigning courses that conform to the preferences of the TAs and the rules set forth by the IT department.