ppxscal/embedding_network huggingface dataset:
Simpler and more accurate throughput analysis of a DS CDMA-unslotted ALOHA system with two user classes based on M-M-infinity queueing model
Authors: Shu-Ming Tseng, Yu-Chin Kuo, Yi-Cheng Chang, Der-Feng Tseng
Venue: International Journal of Communication Systems (2009)

We propose that the throughput performance of the DS CDMA unslotted ALOHA system with two user classes is analyzed by the M-M-infinity queueing model without the death rate approximation. The previous scheme uses the M-D-infinity queueing model with the death rate approximation. The new analysis method is simpler than the previous one because four-dimensional summation is replaced by two-dimensional summation in the packet success probability calculation. The speed of new analysis program is 250 times faster than that of the previous one. In the numerical results, we consider the cases when the message arrival rates of the two classes are equal or not equal, and the access control is present or not. It shows that the proposed scheme has more accurate analyzed throughput than the previous one does. Copyright &copy; 2009 John Wiley & Sons, Ltd. We proposed that the throughput performance of the DS CDMA unslotted ALOHA system with two user classes is analyzed by the M-M-infinity queueing model without the death rate approximation. The new analysis method is simpler than the previous one because four-dimensional summation is replaced by two-dimensional summation in the packet success probability calculation. The speed of new analysis program is 250 times faster. The numerical results show that the proposed scheme has more accurate analyzed throughput. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Sliding Mode Control of an Actuator
Authors: Zhiqiang Liu, Yanhong Wu, Guangcai Han
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

A novel kind of actuator which is used to suppress vibration of ship deck resulted from unbalanced moment of motor or screw propeller is presented in this paper. Frequency and magnitude of exciting force can be adjusted on line. The control equation of the actuator system is non-linear. For eliminating the effect of variation of system parameters and external disturbance on tracking capability, sliding mode control is introduced in the servo control system. In order to attenuate the chattering phenomena, reaching law is used to track the trajectory of position and velocity of the actuator. Simulation and experiments study have been carried out to evaluate the performance of the sliding mode controller, and the results show that the controller has achieved a performance with minimum reaching time and smooth control actions. In addition, the results also revealed that the controller has strong effectiveness and robustness of the trajectory tracking.
Numerical analysis of the Burgers' equation in the presence of uncertainty
Authors: Per Pettersson, Gianluca Iaccarino, Jan Nordström
Venue: Journal of Computational Physics (2009)

The Burgers' equation with uncertain initial and boundary conditions is investigated using a polynomial chaos (PC) expansion approach where the solution is represented as a truncated series of stochastic, orthogonal polynomials. The analysis of well-posedness for the system resulting after Galerkin projection is presented and follows the pattern of the corresponding deterministic Burgers equation. The numerical discretization is based on spatial derivative operators satisfying the summation by parts property and weak boundary conditions to ensure stability. Similarly to the deterministic case, the explicit time step for the hyperbolic stochastic problem is proportional to the inverse of the largest eigenvalue of the system matrix. The time step naturally decreases compared to the deterministic case since the spectral radius of the continuous problem grows with the number of polynomial chaos coefficients. An estimate of the eigenvalues is provided. A characteristic analysis of the truncated PC system is presented and gives a qualitative description of the development of the system over time for different initial and boundary conditions. It is shown that a precise statistical characterization of the input uncertainty is required and partial information, e.g. the expected values and the variance, are not sufficient to obtain a solution. An analytical solution is derived and the coefficients of the infinite PC expansion are shown to be smooth, while the corresponding coefficients of the truncated expansion are discontinuous.
AR Display for Observing Sports Events Based on Camera Tracking Using Pattern of Ground
Authors: Akihito Enomoto, Hideo Saito
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

We present an AR display system for observing sports events on a desktop stadium based on fcamera tracking using pattern of the desktop ground by overlaying players in real sports events captured with multiple cameras. In this paper, we take soccer as the sports event. In the proposed system, the pose and the position of an observing camera are estimated in real-time by using a soccer field pattern on the desk top and an AR marker. The soccer field pattern in the desktop stadium on which the object soccer game is observed via AR display is previously registered with the real soccer stadium in which the real soccer game is captured with multiple cameras. In the previous procedure, we also estimate camera parameters (projection matrices) of the multiple cameras capturing the real soccer game using planar structures in the soccer field. Positions of soccer player and ball are also previously estimated based on the camera parameters. In the on-line procedure for AR display, the textures of the players captured in the multiple soccer video are simply overlaid onto AR camera videos with CG models which are generated for giving additional visual information.
Optimizing Sensing: From Water to the Web
Authors: Andreas Krause, Carlos Guestrin
Venue: Computer (2009)

Where should we place sensors to quickly detect contamination in drinking water distribution networks? Which blogs should we read to learn about the biggest stories on the Web? Such problems are typically NP-hard in theory and extremely challenging in practice. The authors present algorithms that exploit submodularity to efficiently find provably near-optimal solutions to large, complex real-world sensing problems.
Clustering with Discrete Power Control in Wireless Sensor Networks
Authors: Nauman Aslam, William Robertson, William Phillips
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

This paper investigates the effects of using a realistic discrete power model in cluster-based communication for Wireless Sensor Networks (WSNs). Four different clustering protocols are evaluated by incorporating a model compliant with Crossbow MICAz motes. The energy consumption model takes into account the discrete transmit power levels of the CC2420 radio chip used by MICAz sensor nodes. The radio propagation path loss is modeled by using the Lognormal Shadowing Model. The significance of discrete power model is demonstrated by a comparison with the conventional model using metrics such as transmission cost, network lifetime and mean energy consumed. The simulation results demonstrate that realistic assumptions can affect the system behavior drastically in comparison with the results obtained under ideal conditions.
Challenges for Blog Analysis and Possible Solutions
Authors: Anh Vu Nguyen-Ngoc, Effie Lai-Chong Law
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

Blogs are increasingly used as an educational tool because of their ease of use for web-based publishing, enabling users to share their thoughts that invite intellectual and social discourses. Blogs are becoming a significant component of many web-based learning environments. However, there are 2 major challenges in applying blogs in web-based learning: (i) browsing/searching blog archives are technically not well supported in a learning environment in which several blogs are used by both facilitators and students; (ii) there is lack of a theoretically sound and usable blog analysis scheme to analyse blog content in order to support the evaluation of collaborative learning activities in web-based courses. In this paper, we describe some possible solutions for these challenges based on our research on web-based collaborative learning settings. Our experience of applying blogs in a web-based cross-cultural collaborative learning course is also reported.
Testing Component-Based Web Applications Using Component Automata
Authors: Zhongsheng Qian
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Web testing is a promising technique to ensure the high quality of Web applications. This work regards a Web application as the composition of different interacting components. A composite component consists of several other components. A Component Interaction Diagram (CID) is constructed from the specification of the Web application under test. The CID is described in XML fashion. For each component, a component automaton is established. According to the CID, the Component Test Sequences (CTSs) are generated. The CTSs are in fact the interacting sequences of the components. The test cases, which are individual XML documents, are the CTSs with input data and then the Web testing becomes the testing of component interaction automata. Finally, the evaluation of Component Test Sequence Coverage (CTSC) is performed and a method to increase the CTSC is presented.
Application of Fuzzy-C-Means Algorithm Based on Rough Set in Client Subdivision Research
Authors: Jing Wang, Niu Gai Fang, Qingyu Sun
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

In an increasingly competitive market, the management of client relationship is becoming a key point for a enterprise to get a success in the competition, client subdivision is a foundation for the enterprise to make a precise marketing strategy and a successful management of client group, based on the development of data mining technology, a Fuzzy-C-Means(FCM) algorithm model is founded to do the client subdivision in this paper, Selecting the Rough Set(RS) to make a reduction to the redundancy attributes of the sample, thus reducing the dimensions of the sample input space, at a certain extent improved the accuracy and the classify effect of this algorithm, through analyses the clustering results, we provide a quantitative basis for the enterprise in the proceeding of making a marketing strategy, enhanced the pertinency and efficiency of the enterprise marketing activities
Design and evaluation of a collaborative learning environment
Authors: Qiyun Wang
Venue: Computers Education (2009)

Collaboration becomes an essential competency in the current knowledge society. In this study, a collaborative learning environment was designed to facilitate students in group collaboration. Instructional support strategies of friendship and meaningful learning tasks were applied to promote collaboration. Scaffolding strategies such as writing progress reports and developing product versions were used to coordinate and monitor the collaborative learning environment. In addition, the online file sharing tool DriveHQ was used to facilitate collaboration. Four classes of students used the learning environment to complete their final project in pairs. Results showed friendship and meaningful learning tasks helped to promote individual accountability and positive interdependence, and the use of progress reports and product versions was useful for coordinating and monitoring the learning process. However, additional strategies might be needed for more effective collaboration to take place. Issues involved in this study are discussed.
Kernel-Based Image Retrieval with Ontology
Authors: Pang Shuxia, Yuan Zhanting, Zhang Qiuyu, Li Rui
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Due to the huge increase in the amount ofdigital images available in the explosive Internet era,making efficient Content Based Image Retrieval (CBIR)systems has become one of the major endeavors. In thispaper, the authors study the integration of subsequencekernel function based on ontology. Using the VSM tocreate subsequence kernels, The kernel methodologydescribed here not only overcome the VSM ignoring anysemantic relation between words, but also result both infunctional similarity and in sequence/words similarity bygap-weighted subsequences kernels, and semanticcharacter is also taken into account. Experiments showthat the method has more exact retrieval results, and itscost is under the accepted tolerance.
A New Approach to Χ2 Cryptanalysis of Block Ciphers
Authors: Jorge Nakahara,  Jr., Gautham Sekar, Daniel Santana Freitas, Chang Chiann, Ramon Hugo Souza, Bart Preneel
Venue: Proceedings of the 12th International Conference on Information Security (2009)

The main contribution of this paper is a new approach to Χ 2 analyses of block ciphers in which plaintexts are chosen in a manner similar to that in a square/saturation attack. The consequence is a faster detection of Χ 2 correlation when compared to conventional Χ 2 cryptanalysis. Using this technique we (i) improve the previously best-known Χ 2 attacks on 2- and 4-round RC6, and (ii) mount the first attacks on the MRC6 and ERC6 block ciphers. The analyses of these fast primitives were also motivated by their low diffusion power and, in the case of MRC6 and ERC6, their large block sizes, that favour their use in the construction of compression functions. Our analyses indicate that up to 98 rounds of MRC6 and 44 rounds of ERC6 could be attacked.
The Managed Adapter Pattern: Facilitating Glue Code Generation for Component Reuse
Authors: Oliver Hummel, Colin Atkinson
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

The adapter or wrapper pattern is one of the most widely used patterns in software engineering since the problem of reconciling unsuitable component interfaces is so ubiquitous. However, the classic adapter pattern as described by the Gang of Four has some limitations which rule out its use in certain situations. Of the two forms of the pattern, only the object adapter form is usable with common programming languages not supporting multiple inheritance (such as Java or C#), and this is not able to adapt interfaces of classes whose own type is used in one or more of their operations. This makes it impossible for a tool to automatically generate "glue code" for such components and forces developers to come up with some non-trivial (and typically invasive) workarounds to enable clients to use them. In this paper we present an enhanced form of the adapter pattern which solves this problem by extending the way in which an adapter stores and manages adaptees. We therefore call it the Managed Adapter Pattern. After describing the pattern in the usual Gang of Four-oriented way, we describe its application in the system that initially motivated its development --- a test-driven component search engine which is able to retrieve reusable assets based on their semantics. A key challenge in the implementation of this engine was developing a flexible glue code generator that was able to automate the creation of adapters for all the kinds of components delivered by the underlying component repository.
Research on Artificial Target Image Matching
Authors: Zhanli Li, Yue Xi
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Image matching is one of most important problems in close-range photogrammetry. In order to improve the speed of image matching, many artificial targets are placed in measurement scene. There are two kinds of artificial targets, encoded target and non-coded target. How to match the target images is discussed in detail in the paper. An image matching method for encoded targets is introduced, in which several geometry invariants is used. An image matching method for non-coded target is presented, which make full use of the image matching results for en-coded targets, and in which epipolar geometry constraint is used. The three dimensional reconstruction is used in the method, which make the image matching for non-coded targets more fast and. exact A software is developed based on the method. An experiment has been done, and the results show the method is correct and effective.
Investigating cross-language speech retrieval for a spontaneous conversational speech collection
Authors: Diana Inkpen, Muath Alzghool, Gareth J. F. Jones, Douglas W. Oard
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

Cross-language retrieval of spontaneous speech combines the challenges of working with noisy automated transcription and language translation. The CLEF 2005 Cross-Language Speech Retrieval (CL-SR) task provides a standard test collection to investigate these challenges. We show that we can improve retrieval performance: by careful selection of the term weighting scheme; by decomposing automated transcripts into phonetic substrings to help ameliorate transcription errors; and by combining automatic transcriptions with manually-assigned metadata. We further show that topic translation with online machine translation resources yields effective CL-SR.
High-Dimension Simplex Genetic Algorithm and Its Application to Optimize Hyper-high Dimension Functions
Authors: Xiao Hongfeng, Tan Guanzheng
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Simplex-based hybrid genetic algorithms (Simplex HGAs) have been applied with success to many numerical optimization problems in recent years. However, they often lose their effective when applied to hyper-high dimension optimization problems. In this paper, a novel Simplex-based genetic algorithm (Simplex GA) is proposed to solve hyper-high dimension optimization problems. Simplex GA is a fusion of the multi-direction searches of Nelder-Mead simplex and the evolution mechanism of GA, which has its own reproduce operators: extremem mutation and directional reproduce operators. Extremem mutation is devised for the best individual and directional reproduce operators for the other individuals. Directional reproduce operators are based on simplex multi-direction searches and search for new individuals according to the new search mode from point, line to plane. In Simplex GA, evolution simplex is a primary element and an extreme case is discussed in this paper, i.e., high -dimension simplex-GA (HD-Simplex GA), where the number of evolution simplex vertex is large and the number of evolution simplexes is little. Extensive computational studies are carried out to evaluate the performance of HD-Simplex GA on several benchmark functions with up to 1000-1500 dimensions. The results show clearly that HD-Simplex GA is effective and efficient for hyper-high dimension optimization problems.
Windows Server 2008 Hyper-V: Insiders Guide to Microsoft's Hypervisor
Authors: John Kelbley, Mike Sterling, Allen Stewart
Venue:  (2009)

Hyper-V is one of the top virtualization products, and this practical guide focuses on the essentials of Windows Server 2008 Hyper-V. Written by the Microsoft team behind the Hyper-V product, this book shows you how to perform key virtualization scenarios, such as server consolidation, software test and development, and a dynamic data center and demonstrates how Hyper-V can be used to reduce cost and eliminate the complexity of a server infrastructure by consolidating workloads to a small number of machines. In addition, the material addresses using DPM, and SCOM with VMM in order to maintain and manage Hyper-V environments.
Efficiency-Aware QoS DRAM Scheduler
Authors: Menghao Su, Xiang Gao, Yunji Chen, Qi Liu, Longbing Zhang
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

For most SoCs, off-chip DRAM is an important resource that is shared by many heterogeneous function units(FU).To meet different memory access requirements by these FUs,it is crucial that the memory subsystem is capable of providing different Quality of Service(QoS).Due to the nature of DRAM, the available bandwidth greatly depends on the memory access sequence. However,conventional schedulers are not aware of the variable bandwidth.In this paper, a QoS scheduler is proposed by recognizing the inefficiency caused by ongoing memory accesses.The experimental results show that, the scheduler can provide bandwidth guarantee for bandwidth sensitive FUs even in the worst case scenarios. And low latency for latency sensitive FUs can be achieved when the bus is below the saturation point.
The MediaSense Framework
Authors: Theo Kanter, Patrik Osterberg, Jamie Walters, Victor Kardeby, Stefan Forsstrom, Stefan Pettersson
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

Mobile telecommunication is evolving rapidly. People no longer only communicate with each other regardless of time and place, but also share other information that is important for tasks with which they are involved. In response to this growing trend the MediaSense framework addresses the intelligent delivery of any information to any host, anywhere, based on context-aware information regarding personal preferences, presence information, and sensor values. This includes another challenge to achieve seamless delivery, especially of multimedia content, and multimodal services via heterogeneous connections.
On the Recognizability of Self-generating Sets
Authors: Tomi Kärki, Anne Lacroix, Michel Rigo
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

Let I be a finite set of integers and F be a finite set of maps of the form n¿k i n + ¿ i with integer coefficients. For an integer base k ¿ 2, we study the k-recognizability of the minimal set X of integers containing I and satisfying φ(X) ¿ X for all φ ¿ F. In particular, solving a conjecture of Allouche, Shallit and Skordev, we show under some technical conditions that if two of the constants k i are multiplicatively independent, then X is not k-recognizable for any k ¿ 2.
Performance evaluation of adaptive dual microphone systems
Authors: Jianfeng Chen, Koksoon Phua, Louis Shue, Hanwu Sun
Venue: Speech Communication (2009)

In this paper, the performance of the adaptive noise cancellation method is evaluated on several possible dual microphone system (DMS) configurations. Two groups of DMS are taken into consideration with one consisting of two omnidirectional microphones and another involving directional microphones. The properties of these methods are theoretically analyzed under incoherent, coherent and diffuse noise respectively. To further investigate their achievable noise reduction performance in real situations, a series of experiments in simulated and real office environments are carried out. Some recommendations are given at the end for designing and choosing the suitable methods in real applications.