Web Object Size Satisfying Mean Waiting Time in Multiple Access Environment

The software analysis and design could be executed by Object Oriented architecture, but it might be unsuitable for Web Services due to their interoperability and transmission. Oppositely, the Service-Oriented and Resource-Oriented Architectures should allow of them. The software builds up a bridge between two Internet services or resources. This study has proposed what software analysis and design of Web Services can adopt the Structure-Behavior Coalescence Diagram and UML-like state and class diagrams as domain description language with Model-Driven Architecture development cycle. The case study of Plurk social website is successfully tested and verified.

Web services facilitate agile development and deployment of new services in e-Government systems. Due to their distributed nature, Web services as well as e-Government systems must be secured against various cyber attacks and ensured that only authorized users can have access to valuable and sometimes sensitive information and resources. However, correct and efficient security engineering for Web service-based e-Government systems is not a trivial task. Model-driven security (MDS) is considered to be a promising approach to reduce complexity and increase efficiency in the design and development of secure Web services for e-Government systems. Nevertheless, the practicability of MDS has yet not been fully assessed. In a recent pilot project, we have applied MDS to the design and development of Web services for the actual e-Government system in Austria. Our work shows that despite extensive research work, several aspects of MDS need to be adapted and further developed such that one can really benefit from such an approach in practice. Our work on addressing these aspects provides realistic assessment and valuable insights on the application of MDS to Web services in the real world.

The contribution is a logical continuation of a whole series of authors' works in the field of using abstract vector spaces for digital signal processing. In doing so, the authors specialize in the processing of specific signals related processes in geotechnology. In the first part of this paper are characterized appropriate mathematical starting points, using which was compiled web application. The application solves the mutual comparison of each input element-vector with reference elements and using inner product and mathematical view of these elements, to each element is assigned a corresponding position in three-dimensional Euclidean vector space. On the basis of this application was in our department designed and implemented web service Nto3Service. The term web service refers to the technologies that allow for making connections. A service is the endpoint of a connection. Also, a service has some type of underlying computer system that supports the connection offered [1]. A detailed description of the design of web service is a content of second part of the paper. It covers the purpose of the service, description of the various methods of service and their parameters, structure of the web service, the web service output structures, a description of the error states and a description of the WSDL (web services description language) file. Next part of the contribution specifies the implementation of the web service and how to create a service client. In the description of the presentation application of web service are listed its various functions, illustrative example and applications areas. The final part of the contribution summarizes the results obtained and how to use them to solve practical problems by different users in different development environments.

To solve the problem of current communication network for smart distribution automation, key technologies of heterogeneous networks were analyzed and researched, including network resource management, dynamic network selection and intelligent switching strategy as well as channel protection algorithm in multiple access environments. A series of improvements and optimization methods were proposed.

The powerful benefits of multi-antenna systems can be obtained by cooperative communications among users in multiple access environments without the need for physical arrays. This paper studies a novel cooperative signaling strategy that achieves high performance and low implementation complexity for synchronous code division multiple access (CDMA) wireless mobile networks. The validity of the proposed strategy under slow flat Rayleigh fading channel plus additive white Gaussian noise (AWGN) is verified through closed-form error probability expressions and Monte-Carlo simulations. A variety of analytical results reveal that the new cooperative strategy significantly outperforms direct transmission subject to the same spectral efficiency and transmit power constraint.

It is argued that iterative signal cancellation receivers, with or without the use of error control coding, are preferred for practically viable multiuser detection. Achievable spectral efficiencies are calculated for both cases and arguments are given on how to achieve maximum spectral efficiencies by rate or power layering of the different users in a multiple access environment. The achievable spectral efficiencies of iterative cancellation receivers, which include error control codes, are compared to those which do not. The latter are found to be essentially viable only in power controlled environments.

This paper investigates the effects of using error-and-erasure decoding in coded parallel combinatorial spread spectrum (PC/SS) systems over Rayleigh fading channels. The PC/SS system is an advanced multi-code direct sequence spread spectrum system for high-speed data transmission. Our previous works have shown that the Reed-Solomon (RS) coded PC/SS systems provide significant improvement in error rate performance over conventional DS/SS systems. To achieve further performance improvement in the PC/SS systems, error-and-erasure decoding techniques are implemented in the RS coded PC/SS receiver. To obtain the erasure location information, a threshold for the signal-to-noise ratio is set at the correlator output. Numerical results show that the coded PC/SS systems with error-and-erasure decoding provides significant improvement in the bit error rate (BER). With errors-only decoding, the PC/SS systems cannot improve the error rate performance because of large SNR penalty introduced by coding. On the contrary, error-and erasure decoding still improves the performance of PC/SS systems under multiple access environment.

The effects of filtering in transmitters on the bit error performance of a binary asynchronous direct sequence spread spectrum communication system are examined in a multiple access environment. Computer simulations are carried out to evaluate the effects of non-linear phase Chebyshev and Butterworth filters and linear phase Bessel, Gauss and Nyquist roll-off filters. The performance degradation of the system is compared and discussed in terms of the BT product of the filter or the transmitted spectrum. >

We propose a zero correlation duration-ultra wideband (ZCD-UWB) wireless communication system based on the direct sequence ultra wideband (DS-UWB) scheme and special spreading sequences with zero correlation duration (ZCD) characteristics (Cha, J.S. et al., Electron. Lett., vol.36, no.11, p.991-3, 2000). Especially, we propose a ternary ZCD-UWB communication system having a novel interference-cancellation property. After constructing an enhanced ternary ZCD sequence and mathematical model for a ZCD-UWB wireless system, we present the theoretical bit error rate (BER) performance. By computer simulation, we verify the high system capacity of the proposed system and a performance superior to the conventional Walsh-based DS-UWB systems in multipath and in multiple access environments. We show that the proposed system can remove the interference signal perfectly without employing complicated hardware, such as multiuser detection (MUD) or other interference cancellation techniques.

This paper describes the Computer Network installed at a Steel Plant in Central India for Traffic Management function. The movement of Railway Wagons and Locomotives used for loading and unloading of material in the Steel Plant is managed by an on-line computerised information system. The system comprises of one mini computer installed at a central site and 20 personal computers installed at remote sites. The data communication between the mini computer and remote PCS takes place through Radio links in a multiple access environment.

Transform domain communication system (TDCS) and wavelet domain communication system (WDCS) have been reported to have interference avoiding capability under adverse environmental conditions. These systems achieve low probability of intercept (LPI) and orthogonality simultaneously by using the pseudorandom (PR) sequences for generating the phase vector of the basic function. Conventionally, the PR phase vectors in TDCS and WDCS were generated by a maximal length binary PR sequence (m-sequence), which allows only a relatively small number of users in the systems. This paper reports a method to increase the user capacity of TDCS and WDCS by applying Gold sequence to generate the PR phase vector of the basic function. The increased user capacity of the systems based on Gold sequence is tabulated. Simulation results also demonstrate that by using Gold sequences for the PR phase generation, both TDCS and WDCS can provide a comparable interference avoiding capability with a larger user capacity, compared to those of the systems based on m-sequences in multiple access environments.

While both SOAP and REST have been used widely to implement Web services and software integration, over time REST has emerged as the predominant approach. REST provides developers with a lower barrier to entry for implementation and greater development flexibility than SOAP. Its architectural conventions and best practices can be integrated into Web services incrementally as opposed to the all-or-nothing adoption of SOAP. In order to achieve generality, SOAP standards are extensive, rigid, and complex. This complexity can lead to implementations that introduce significant overhead on the network bandwidth consumption, execution times, and throughput of SOAP services, especially in the emerging resource-restricted mobile realm. This chapter provides an overview of the logical and physical design of modern Web services and discusses the strengths and weaknesses of the predominant styles. It provides evidence and reasoning behind the emergence of REST as the leader for the development of next-generation Web APIs and services. The chapter also delineates the key technologies that underlie REST and describes emerging and future research directions in support of REST-based APIs and service development.

We have conducted a research in order to clarify a movement of a top table tennis player using DLT method. We have tried to obtain basic data such as time intervals of various playing, times of shots, playing area, distance of movement and so on to plan a training program of a movement for table tennis.The objects of analysis were 5 games of YOO Nam Kyu, who was the SEOUL Olympic champion, in the 9th ASIAN Table Tennis Championships in Japan. The games were filmed at 60 frames/second with 6 VTR cameras which were installed at separate locations in the gymnasium. For the purpose of this analysis, the various time intervals are defined as follows: In-play Time was from the initial movement of the service to final contact with the ball during play. It is acknowledged that this definition differs slightly from the official ITTF regurations for “ball in play” time. Rally Time was from contact with the ball on service to final contact with the ball during play. Service Time was from the initial movement of the service to contact with the ball on service. Waiting Time was from one player's contact with the ball to the other player's contact.Two-dimensional coordinates on a TV monitor were computed with a VTR motion analyzer connected to a personal computer. These coordinates were then converted to real (X-Y-Z) coordinates using DLT method. The position of the player was estimated from the coordinates of the player's head (vertex), center of shoulders (acromions), center of hips (trochanterions) and center of ankles (malleolus fibulae points). Distance of movement and velocity of movement were computed for every body point in several directions; right to left and forward to backward (in relation to the table), and up to down. Distance of movement was a line that links the position of the player every 0.1 sec during Rally-time. Velocity of movement was calculated by dividing distance of movement by Rally-time for each rally.The results and findings are summarized as follows;1) Mean total In-play time was 144.63±27.69 sec (±SD). This represented about 20-30% of the games of which average was 611.75±33.50 sec long, meaning that about 70-80% of the games was excess time spent doing such things as picking up the ball or wiping off perspiration.2) Mean Service Time, Mean Rally Time, Mean In-play Time and Mean Waiting Time was 1.05±0.37 sec, 2.56±1.79 sec, 3.60±1.83 sec and 0.66±0.19 sec, respectively. This represented about 30% of In-play Time was Service Time and about 70% of it was Rally Time.3) Mean times of shots during 1 rally was 4.61±2.12. The distribution of times of shots during 1 rally showed that in the case of 74.6% of all rally, a player won or lost a point in 5 shots.4) The playing area for YOO was positioned at the side of his free hand in 4 games. In 1 game, it was positioned at the side of his racket hand. His main stroke of the game was different from previous 4 games.5) In each game, the distance of movement for YOO on a horizontal plane during Rally Time was between about 100m and 200m at the center of the ankles. And mean distance of movement for YOO on a horizontal plane during 1 rally was between about 3.5m and 4.0m at the center of the ankles. In the table tennis games, the player's repeated acceleration and deceleration in various directions was instantaneous.6) In each game, mean average velocity of movement for YOO on a horizontal plane during 1 rally was between 0.85m/sec and 1.08m/sec at the head, 0.90m/sec and 1.05m/sec at the center of the shoulders, 0.99m/sec and 1.18m/sec at the center of the hips and 1.36m/sec and 1.51m/sec at the center of the ankles.7) It seems that these new data and findings are very important to plan an efficient training program for table tennis coaches and players.

In this paper, we describe the design of web service with model-view-controller for implement the system of classify type of rice. This idea using LDA and SVM to estimate a rice surface area, and then we present this idea by create web service architecture and present prototype used in mobile. The process of making a model are choosing the literature of rice attribute compare with a hundred pieces of rice in different sizes and type, and then analyzed all of example by create web service that implement under spring MVC idea. In testing method of technique, we create prototype of web service and test function by user. The result shows that the model gives accurate result with very small errors and is also flexible to any change in all process.

Web services (WS) is called composite or compound when its execution involves interactions with other WS to utilize their features. The service providers published the web services through the internet as independent software components that are fulfilling the requirements of customer request. Clustering is more necessary for efficient web service discovery and web service composition processes. Clustering process groups the similar type of web services. In this paper, efficient clustering methods such as k-means clustering, Hierarchical agglomerative clustering and Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) clustering are introduced for web service clustering. The k-means clustering is a kind of partitional clustering where the web pages are divided into subsets with no hierarchy defined over them and the hierarchical agglomerative clustering is a type of hierarchical clustering where the web pages are arranged in tree structure in which leaves represents the data points and nodes denotes the clusters. BIRCH is an integrated hierarchical clustering algorithm uses the clustering features and cluster feature tree for general cluster description. Based on these clustering methods, web pages are clustered which are used for web service discovery and web service composition. The experiments are conducted on number of web services and the efficiency is evaluated in terms of accuracy, precision, recall and run time.