ppxscal/embedding_network huggingface dataset:
Cooperative Spectrum Sensing for Dynamic Spectrum Access
Authors: Yunxue Liu, Dongfeng Yuan, Mingyan Jiang, Gang Jin, Shasha Ji, Xiaozhen Liu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In cognitive networks, cooperative spectrum sensing is employed to detect the presence of primary user quickly. In this paper, we study the sensing performance of a cognitive user U1 by allowing another cognitive user U2 to act as its relay. We vary the scaling factors (used by the relay U2 to amplify its received signal) of the unconstrained scheme (there is not power constrain for relay), and develop the formulas of detection and false alarm probability for cooperative scheme based on cooperative relay. We then pay much attention to studying how to find a proper relay U2 for U1 so that the detection capability of U1 can be improved. We find that, the normalized received power of U2 should be larger than a certain value which is called gain point if U1 can benefit from the cooperation. We present the relationship of gain points between the constrained scheme and unconstrained scheme. Results are well interpreted and supported by exhausted numerical computations.
Identifying idiosyncratic stock return indicators from large financial factor set via least angle regression
Authors: Zitian Wang, Shaohua Tan
Venue: Expert Systems with Applications: An International Journal (2009)

Identifying important indicating factors for expected level of stock return has been one of the central problems in modern finance. Researchers have worked on different candidate sets of indicators from different perspectives, but there has not been a consensus reached on which factors to be included in the model. In this paper, based on relative complete information from a large set of factors from US financial reports, we use least angle regression (LARS) to select a sparse and relatively stable set of indicators for predicting stock return. The use of LARS is consistent with the theoretically well developed economic theory arbitrage pricing model. The empirical results offer new insights of the well-known indicators from the previous studies and discover new important factors.
Energy proportion analysis of cooperative transmission protocols
Authors: Tuan-fa Qin, Hui-ping Luo, Su-yun Liao
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

This paper investigates the energy gain offered by implementing network coding over wireless communication links. In this system, a source and a relay transmit each others' messages to a common destination using decode-and-forward strategies. The network coding algorithm is applied to a wireless network which supports user cooperation between three nodes. Based on the relay's different choice of transmitting message, cooperative transmit protocols is classified into static and adaptive protocols. In this work, the relationship between performance of two types of cooperative transmission protocols and faction of the total energy allocated in the first time slot of cooperative scheme is investigated. The results show that by allocating more energy in the first time slot can make better performance. In static and adaptive schemes, both the repetition-coding-based protocols and network-coding-based protocols lead to better system performance, at a lower outage probability.
Applying the Logic of Multiple-Valued Argumentation to Social Web: SNS and Wikipedia
Authors: Shusuke Kuribara, Safia Abbas, Hajime Sawamura
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

The Logic of Multiple-Valued Argumentation (LMA) is an argumentation framework that allows for argument-based reasoning about uncertain issues under uncertain knowledge. In this paper, we describe its applications to Social Web: SNS and Wikipedia. They are said to be the most influential social Web applications to the present and future information society. For SNS, we present an agent that judges the registration approval for Mymixi in mixi in terms of LMA. For Wikipedia, we focus on the deletion problem of Wikipedia and present agents that argue about the issue on whether contributed articles should be deleted or not, analyzing arguments proposed for deletion in terms of LMA. These attempts reveal that LMA can deal with not only potential applications but also practical ones such as extensive and contemporary applications.
An Efficient Software-Managed Cache Based on Cell Broadband Engine Architecture
Authors: Feng Guofu, Dong Xiaoshe, Wang Xuhao, Chu Ying, Zhang Xingjun
Venue: International Journal of Distributed Sensor Networks (2009)

While the CBEA (Cell Broadband Engine Architecture) offers substantial computational power, its explicit multilevel memory hierarchy poses significant challenges to traditional programming, especially in performance and programmability. Software-managed cache is a technique that attempts to address such issues. But there still remain some limitations in current software-managed cache technologies. First, a complex managing logic of the full implementation of the software-managed cache which is not suitable for SPU designed as a vector computational unit influences computation significantly. Second, the external managing code of the software-managed cache causes the amount of computing code explosion. Besides increasing the computing burden of the accelerator, the external code occupies precious room of local storage which is shared by computing code and data. Finally, its inconvenient user interface presents significant obstacles for it to be widely applied. Based on the locality of memory access, this paper proposes an efficient software-managed cache named ECellS cache. In the paper, several customized library interfaces were designed respectively to simplify the cache implementation and reduce cache code size. On the other hand, the code segment of the application which accesses data residing in main memory frequently is defined as a cache section. Several of these types of cache sections could be combined into a “cache bind” and be managed in parallel by using SIMD technology. By this type of coarse-grain managing method and additional simplifying the construction of software cache, ECellS cache reduces both the burden of SPU to manage the cache buffer and the size of the cache managing code. Finally, based on local address remapping technology, a more convenient programming interface which is similar to OpenMP directive is presented to facilitate programming. By this technology, requesting for data residing in the main memory will be automatically mapped to cache buffer in local storage of SPE, and there needs to be no extra modifying for the computing source code inside the cache section except for inserting the directive outside of it. Experimental results of this paper based on the Cell processor demonstrate that our proposed software-managed cache improves performance by 15-35% over the CBE SDK software-managed cache in most test cases. With ECellS cache it could be more convenient for the user to develop and port applications based on CBE architecture.
A Novel Composite Camera Calibration Method and its Application in Vehicle Impact Experiment
Authors: Xiang Liu, Qianmin Su, Zibing Deng
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

A composite camera calibration method is presented, in which step-by-step calibration based on coplanar targets is taken in the process of determining the extrinsic and intrinsic parameters of camera and the least squares method is taken for solving radial distortion parameters and further iterative optimization. Moreover among the identification of calibration points, the encoding unit is introduced to realize the automatic matching between the calibration points and pixel points. Besides that, the algorithm of line detection based on Hough transform and line intersection is taken for the identification of central position, so as to avoid the measurement error from usual Hough oval detection methods. Finally this method is applied to the qualitative and quantitative analysis of automotive collision course. The results show its obvious effectiveness and stability.
Hardware/Software FPGA Architecture for Robotics Applications
Authors: Juan Carlos Moctezuma Eugenio, Miguel Arias Estrada
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

This work presents a Hardware/Software FPGA Robotics Architecture for applications on Mobile Robotics. A test mobile robot was built and it is based in a commercial programmable robot called Create from iRobot, also the test platform has additional components like sonars, infrared sensors and a robotic arm, these components are used to increase robot's functionality and to show that it is feasible to build any kind of hybrid robot. The Hardware/Software Architecture is a complete Embedded System (ES). Hardware side includes processor, buses, memory and peripherals like co-processors, sensors, robotic arm, controllers, UARTs, etc., Software side includes a Linux OS with a set of libraries that performs different functionalities and to control all components in FPGA, these functions are easy-understanding for robotic programmers. The main purpose of this work is to show the advantages of using FPGAs to implement Robotics Platforms. Some of these advantages are parallelism, flexibility and scalability. Finally some experiments was performed to show these advantages.
An Improved Gossiping Data Distribution Technique with Emphasis on Reliability and Resource Constraints
Authors: S. Kheiri, MB. Ghaznavi Goushchi, M. Rafiee, B. Seyfe
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper we present an improved Gossiping data distribution technique with emphasis on the location of nodes called "LGossiping" that reliably disseminate information among sensors in a wireless sensor network. Nodes running LGossiping data distribution technique use global positioning system to relay data throughout the network. Each node decides upon position knowledge of the others. This allows each sensor to send its data reliably to one of known neighbors instead of sending data blindly to one of neighbors which may not be near to source node and cause data lost. We outlined SystemC as simulation language and simulate and analyzed Gossiping and LGossiping protocols. In each experiment source node propagate data among nodes with the hope of reaching to sink node. This procedure is called data transmission. We found that LGossiping with transmission radius greater than or equal to 4 (TR>=4) is 30% more reliable than Gossiping for a specific number of experiments. LGossiping is an improvement of Gossiping in terms of reliability. Therefore reliability in this improved method is critical. Moreover, network energy consumption with respect to different TR is considered. We concluded that network energy consumption decreases as the transmission radius increases. As termination, increasing area during the experiment is mentioned. In order to have constant reliability with constant number of nodes in LGossiping method in immense areas, with each 600m2 increase of area transmission radius should increases 1 meter.
Extra-proximal methods for solving two-person nonzero-sum games
Authors: Anatoly Antipin
Venue: Mathematical Programming: Series A and B (2009)

We consider two-person nonzero-sum game, both in the classical form and in the form of a game with coupled variables. An extra-proximal approach for finding the game&#x2019;s solutions is suggested and justified. We provide our algorithm with an analysis of its convergence.
HRP-2W: A humanoid platform for research on support behavior in daily life environments
Authors: Tetsunari Inamura, Kei Okada, Satoru Tokutsu, Naotaka Hatao, Masayuki Inaba, Hirochika Inoue
Venue: Robotics and Autonomous Systems (2009)

We introduce a concept of a real-world-oriented humanoid robot that can support humans' activities in daily life. In such environments, robots have to watch humans, understand their behavior, and support their daily life tasks. In particular, these robots must be capable of such real-world behavior as handling tableware and delivering daily commodities by hand. We developed a humanoid robot, HRP-2W, which has an upper body of HRP-2 [K. Kaneko, F. Kanehiro, S. Kajita, H. Hirukawa, T. Kawasaki, M. Hirata, K. Akachi, T. Isozumi, Humanoid Robot HRP-2, in: Proceedings of the 2004 IEEE International Conference on Robotics & Automation, 2004, pp. 1083-1090] and a wheel module instead of legs, as a research platform to fulfill this aim. We also developed basic software configuration in order to integrate our platform with other research groups. Through experiments, we demonstrated the feasibility of the humanoid robot platform and the potential of the software architecture.
Kendo: efficient deterministic multithreading in software
Authors: Marek Olszewski, Jason Ansel, Saman Amarasinghe
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded applications, causes significant challenges for parallel programmers by hindering their ability to create parallel applications with repeatable results. As a consequence, parallel applications are significantly harder to debug, test, and maintain than sequential programs. This paper introduces Kendo: a new software-only system that provides deterministic multithreading of parallel applications. Kendo enforces a deterministic interleaving of lock acquisitions and specially declared non-protected reads through a novel dynamically load-balanced deterministic scheduling algorithm. The algorithm tracks the progress of each thread using performance counters to construct a deterministic logical time that is used to compute an interleaving of shared data accesses that is both deterministic and provides good load balancing. Kendo can run on today's commodity hardware while incurring only a modest performance cost. Experimental results on the SPLASH-2 applications yield a geometric mean overhead of only 16% when running on 4 processors. This low overhead makes it possible to benefit from Kendo even after an application is deployed. Programmers can start using Kendo today to program parallel applications that are easier to develop, debug, and test.
Predicting protein protein interfaces as clusters of Optimal Docking Area points
Authors: Yasir Arafat, Joarder Kamruzzaman, Gour C. Karmakar, Juan Fernandez-Recio
Venue: International Journal of Data Mining and Bioinformatics (2009)

Desolvation property is used here to predict protein-protein binding sites exploiting the fact that lower-valued 'optimal docking area' ODA (Fernandez-Recio et al., 2005) points form cluster at the interface. The proposed method involves two steps; clustering the ODA points and representing ODA points by average ODA values. On 51 nonredundant proteins, results show the success rate improved considerably. Considering only significant ODA, the previous ODA method has obtained a success rate of 65% with overall success rate of 39%. The proposed method improved the overall success rate to 61%. Further, comparable results were found for X-ray and NMR structures.
Detection of Setting and Subject Information in Documentary Video
Authors: Kim Shearer, Svetha Venkatesh
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Interpretation of video information is a difficult task for computer vision and machine intelligence. In this paper we examine the utility of a non-image based source of information about video contents, namely the shot list, and study its use in aiding image interpretation. We show how the shot list may be analysed to produce a simple summary of the "who and where" of a documentary or interview video. In order to detect the subject of a video we use the notion of a "shot syntax" of a particular genre to isolate actual interview sections.
Numerical simulation of solid suspension via mechanical agitation: effect of the modelling approach, turbulence model and hindered settling drag law
Authors: David F. Fletcher, Gary J. Brown
Venue: International Journal of Computational Fluid Dynamics (2009)

This study uses the commercial CFD code ANSYS CFX to explore two different modelling approaches, Eulerian-Eulerian (E-E) and algebraic slip modelling (ASM), for the simulation of the suspension of moderately concentrated slurries (10% by volume of solids). It is shown that the ASM provides a computationally efficient model that performs very similarly to the E-E model. The influence of the choice of turbulence model (phasic or homogeneous) and the role of turbulent dispersion forces are also investigated. In addition, the importance of interfacial drag modelling and other non-drag forces are examined. During this study, the existence of inherent hindered settling in the momentum equation formulation is noted and it is shown how it can be accounted for in hindered drag law implementation.
Overhead and performance study of the general internet signaling transport (GIST) protocol
Authors: Xiaoming Fu, Henning Schulzrinne, Hannes Tschofenig, Christian Dickmann, Dieter Hogrefe
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

The General Internet Signaling Transport (GIST) protocol is currently being developed as the base protocol compo-nent in the IETF Next Steps In Signaling (NSIS) protocol stack to support a variety of signaling applications. We present our study on the protocol overhead and performance aspects of GIST. We quantify network-layer protocol overhead and observe the effects of enhanced modularity and security in GIST. We developed a first open source GIST implementation at the University of Göttingen, and study its performance in a Linux testbed. A GIST node serving 45 000 signaling sessions is found to consume average only 1.1 ms for processing a signaling message and 2.4 KB of memory for managing a session. Individual routines in the GIST code are instrumented to obtain a detailed profile of their contributions to the overall system processing. Important factors in determining performance, such as the number of sessions, state management, refresh frequency, timer management and signaling message size are further discussed. We investigate several mechanisms to improve GIST performance so that it is comparable to an RSVP implementation.
Omnidirectional Inductive Powering for Biomedical Implants, 1st edition
Authors: Bert Lenaerts, Robert Puers
Venue: Analog Circuits And Signal Processing (2008)

Omnidirectional Inductive Powering for Biomedical Implants investigates the feasibility of inductive powering for capsule endoscopy and freely moving systems in general. The main challenge is the random position and orientation of the power receiving system with respect to the emitting magnetic field. Where classic inductive powering assumes a predictable or fixed alignment of the respective coils, the remote system is now free to adopt just any orientation while still maintaining full power capabilities. Before elaborating on different approaches towards omnidirectional powering, the design and optimisation of a general inductive power link is discussed in all its aspects. Special attention is paid to the interaction of the inductive power link with the patient s body. Putting theory into practice, the implementation of an inductive power link for a capsule endoscope is included in a separate chapter.
Note: New permutation statistics: Variation and a variant
Authors: Toufik Mansour, Chunwei Song
Venue: Discrete Applied Mathematics (2009)

For each permutation @p we introduce the variation statistic of @p, as the total number of elements on the right between each two adjacent elements of @p. We modify this new statistic to get a slightly different variant, which behaves more closely like Mahonian statistics such as maj. In this paper we find an explicit formula for the generating function for the number of permutations of length n according to the variation statistic, and for that according to the modified version.
The goal-oriented design of agent systems: a refinement of Prometheus and its evaluation
Authors: Jason Khallouf, Michael Winikoff
Venue: International Journal of Agent-Oriented Software Engineering (2009)

The initial step of any software engineering methodology is to form requirements. Recently, a goal-oriented approach to requirements has been proposed and argued to be beneficial. Goals also play a key role in the implementation of proactive software agents. However, although some agent-oriented software engineering methodologies have incorporated (aspects of) goal-oriented requirements engineering and although they target agent platforms that provide goals as an implementation construct, none of the methodologies provide a goal-oriented design process. We present three modifications to the Prometheus methodology, which aim to make it more goal-oriented in its design phases: we introduce a goal coupling diagram as an adjunct to the existing data coupling diagram, we modify the temporal design artefacts to include goals and we introduce a number of goal-related consistency checks. Finally, we report on an experimental evaluation comparing the effectiveness of the original and refined methodologies.
Quadratic programming formulations for classificationand regression
Authors: Robin C. Gilbert, Theodore B. Trafalis
Venue: Optimization Methods Software (2009)

We reformulate the support vector machine approach to classification and regression problems using a different methodology than the classical 'largest margin' paradigm. From this, we are able to derive extremely simple quadratic programming problems that allow for general symbolic solutions to the classical problems of geometric classification and regression. We obtain a new class of learning machines that are also robust to the presence of small perturbations and/or corrupted or missing data in the training sets (provided that information about the amplitude of the perturbations is known approximately). A high performance framework for very large-scale classification and regression problems based on a Voronoi tessellation of the input space is also introduced in this work. Our approach has been tested on seven benchmark databases with noticeable gain in computational time in comparison with standard decomposition techniques such as SVMlight.
An accumulator-based compaction scheme for online BIST of RAMs
Authors: Ioannis Voyiatzis
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Transparent built-in self test (BIST) schemes for RAM modules assure the preservation of the memory contents during periodic testing. Symmetric transparent BIST skips the signature prediction phase required in traditional transparent BIST schemes, achieving considerable reduction in test time. In symmetric transparent BIST schemes proposed to date, output data compaction is performed using either single-input or multiple-input shift registers whose characteristic polynomials are modified during testing. In this paper the utilization of accumulator modules for output data compaction in symmetric transparent BIST for RAMs is proposed. It is shown that in this way the hardware overhead, the complexity of the controller, and the aliasing probability are considerably reduced.