ppxscal/embedding_network huggingface dataset:
Symphony: synchronous two-phase rate and power control in 802.11 wlans
Authors: Kishore Ramachandran, Ravi Kokku, Honghai Zhang, Marco Gruteser
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Adaptive transmit power control in 802.11 Wireless LANs (WLANs) on a per-link basis helps increase network capacity and improves battery life of Wifi-enabled mobile devices. However, it faces the following challenges: (1) it can exacerbate receiver-side interference and asymmetric channel access, (2) it can incorrectly lead to lowering the data rate of a link, (3) mobility-induced channel variations at short timescales make detecting and avoiding these problems more complex. Despite significant research in rate and power control, state of the art solutions lack comprehensive techniques to address the above problems. In this paper, we design and implement Symphony - a Synchronous Two-phase Rate and Power control system, whose agility in adaptation enables us to systematically address the three problems, while maximizing the benefits of power control on a per-link basis. We implement Symphony in the Linux Madwifi driver, and show that it can be realized on hardware that supports transmit power control with no modifications to the 802.11 MAC, thereby fostering immediate deployability. Our extensive experimental evaluation on a real testbed in an office environment demonstrates that Symphony (1) enables up to 80% of the clients in 3 different cells to settle at 50% to 94% lower transmit power than a per-cell power control solution, (2) increases network throughput by up to 50% across realistic deployment scenarios, (3) improves the throughput of asymmetry-affected links by 300%, and (4) opportunistically reduces the transmit power of mobile clients running VOIP calls by up to 97%, while causing minimum impact on voice quality.
A conceptual model for multidimensional data
Authors: Anand S. Kamble
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

This paper introduces a Conceptual Data Model for Data Warehouse including multidimensional aggregation. It is based on Entity-Relationships data model. The conceptual data model gracefully extends standard Entity-Relationship data model with multidimensional aggregated entities. The model has a clear mathematical theoretic semantics grounded on standard ER semantics and the GMD logic-based multidimensional data model. The aim of this work is not to propose yet another conceptual data model, but to find the most general and precise formalism considering all the proposals for a conceptual data model in the data warehouse field, making therefore a possible formal comparison of the differences of the models in the literature, and to study the formal properties or extensions of such data models.
Spanning triangulations in graphs
Authors: Daniela Kühn, Deryk Osthus
Venue: Journal of Graph Theory (2005)

We prove that every graph of sufficiently large order n and minimum degree at least 2n-3 contains a triangulation as a spanning subgraph. This is best possible: for all integers n, there are graphs of order n and minimum degree &lceil;2n-3&rceil; &thinsp;-&thinsp;1 without a spanning triangulation. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Expertise Recommendation: A Two-Way Knowledge Communication Channel
Authors: Debbie Richards, Meredith Taylor, Peter Busch
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

In our service-based society, expertise is becoming increasingly recognized as a valuable and scarce resource. Thus, the demand for an integrated expert finder that understands whether it has found a current, relevant and credible expert will grow. We offer a three pronged approach which combines data mining, self reporting and referral by others together with a number of strategies which provide feedback and validation of the data gathered via data mining and self-reporting. The feedback mechanism offers a two-way communication channel between the service requester and the service provider, the expert.
Electrothermal microgrippers for pick-and-place operations
Authors: Karin. N. Andersen, Kenneth Carlson, Dirch H. Petersen, Kristian Mølhave, Volkmar Eichhorn, Sergej Fatikow, Peter Bøggild
Venue: Microelectronic Engineering (2008)

Manipulation of carbon nanotubes to assemble functional devices can be done inside a scanning electron microscope in which a suitable combination of visual resolution and sample space allows macroscale manipulators with micro- or nanoscale precision to be incorporated, yet monitored with nm-scale precision. The pick-and-place procedure can be done in several ways. We present here a monolithic electrothermal microgripper, and demonstrate pick-and-place of an as-grown carbon nanotube from a 2D array onto a scanning probe tip, as a first step towards a reliable and precise pick-and-place process for carbon nanotubes.
Freebase: a collaboratively created graph database for structuring human knowledge
Authors: Kurt Bollacker, Colin Evans, Praveen Paritosh, Tim Sturge, Jamie Taylor
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Freebase is a practical, scalable tuple database used to structure general human knowledge. The data in Freebase is collaboratively created, structured, and maintained. Freebase currently contains more than 125,000,000 tuples, more than 4000 types, and more than 7000 properties. Public read/write access to Freebase is allowed through an HTTP-based graph-query API using the Metaweb Query Language (MQL) as a data query and manipulation language. MQL provides an easy-to-use object-oriented interface to the tuple data in Freebase and is designed to facilitate the creation of collaborative, Web-based data-oriented applications.
The Effect of Consumer Privacy Empowerment on Trust and Privacy Concerns in E-Commerce
Authors: Thomas P. Van Dyke, Vishal Midha, Hamid Nemati
Venue: Electronic Markets (2007)

Privacy concerns and a lack of trust have been shown to reduce consumer's willingness to transact with an online vendor. Understandably, firms are searching for methods to reduce consumer privacy concerns and increase trust. In this study, we introduce a new construct-consumer privacy empowerment. We then propose and test a theoretical model that examines the relationship between consumer privacy empowerment, familiarity, privacy concern and trust. Results indicate support for the model and suggest that perceived privacy empowerment has a strong influence on both privacy concern and trust in e-commerce.
Towards energy efficient VoIP over wireless LANs
Authors: Vinod Namboodiri, Lixin Gao
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Wireless LAN (WLAN) radios conserve energy by staying in sleep mode. With real-time applications like VoIP, it is not clear how much energy can be saved by this approach since packets delayed above a threshold are lost. In this work we propose the GreenCall algorithm to derive sleep/wakeup schedules for the WLAN radio to save energy during VoIP calls. The schedules provided by GreenCall consider the energy versus loss-rate tradeoff to ensure application quality is preserved. We implement GreenCall on commodity hardware and study its performance and point out possible limitations. We further extensively evaluate the effect of diverse network paths and different application parameters on possible energy savings through trace-based simulations. We show that, in spite of the interactive, real-time nature of voice, a significant amount of energy can be conserved through GreenCall.
Space-time diversity-enhanced QoS provisioning for real-time service over MC-DS-CDMA based wireless networks
Authors: Xi Zhang, Jia Tang, Hsiao-Hwa Chen
Venue: Wireless Communications Mobile Computing (2008)

In order to support the quality-of-service (QoS) requirements for real-time traffic over broadband wireless networks, advanced techniques such as space-time diversity (STD) and multicarrier direct-sequence code division multiple access (MC-DS-CDMA) are implemented at the physical layer. However, the employment of such techniques evidently affects the QoS provisioning algorithms at the medium access control (MAC) layer. In this paper, we propose a space-time infrastructure and develop a set of cross-layer real-time QoS-provisioning algorithms for admission control, scheduling, and subchannel-allocations. We analytically map the parameters characterizing the STD onto the admission-control region guaranteeing the real-time QoS. Our analytical analyses show that the proposed algorithms can effectively support real-time QoS provisioning. Also presented are numerical solutions and simulation results showing that the STD can significantly improve the QoS provisioning for real-time services over wireless networks. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Building your yield of dreams
Authors: Sachin Sapatnekar
Venue: IEEE Design Test (2008)

This is a review of Design for Manufacturability and Yield for Nano-Scale CMOS (by Charles Chiang and Jamil Kawa). DFM is a rapidly growing field that uses design techniques to improve manufacturing yield. However, the dilution in the interface between design and manufacturing implies that today, to build a circuit with enhanced yield, a designer must know more about manufacturing than ever before. The first step to embracing yield considerations is to learn about them, and this book portrays the landscape of this area in an excellent way. It describes methods for modeling variations, optimizing them, and learning to design around them when they occur. The overall structure of this book is well thought out and logical, and the reader who peruses it will be rewarded with an excellent view of the field.
Routing a maximum number of disks through a scene of moving obstacles
Authors: Joondong Kim, Joseph S.B. Mitchell, Valentin Polishchuk, Arto Vihavainen
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated by applications in air traffic management: aircraft must be routed while avoiding no-fly zones and weather constraints and while maintaining at least a specified horizontal separation distance between themselves. Given a polygonal domain with moving obstacles, our goal is to determine the maximum number of unit disks (aircraft with safety zones) that can be routed safely through the domain, entering/exiting through specified edges of the domain. The video is meant to accompany the paper [1], which gives details of the algorithm and its analysis.
Extracting and ranking viral communities using seeds and content similarity
Authors: Hyun Chul Lee, Allan Borodin, Leslie Goldsmith
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

We study the community extraction problem within the context of networks of blogs and forums. When starting from a small set of known seed nodes, we argue that the use of content information (beyond explicit link information) plays an essential role in the identification of the relevant community. Our approach lends itself to a new and insightful ranking scheme for members of the extracted community and an efficient algorithm for inflating/deflating the extracted community. Using a considerably large commercial data set of blog and forum sites, we provide experimental evidence to demonstrate the utility, efficiency, and stability of our methods.
Antibiotic Susceptibility of Potential Probiotic Lactobacilli Isolated from the Vagina of Chinese Pregnant Women
Authors: Hengyi Xu, Wanhong Tian, Lijun Jia, Bocai Cheng, Hua Wei, Lanyin Wang, Cuixiang Wan, Ming Zeng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

To study the antibiotic susceptibility of eleven vaginal probiotic lactobacilli, the disc diffusion method in LAPTg agars was performed. The results had shown that all strains were resistance to tobramycin, lomefloxacin, nalidixic scid, ofloxacin, enoxacin, ciprofloxacin, norfloxacin and fleroxacin. There of eight were resistance to sparfloxacin, six were resistance to gentamicin and netilmicin. All the lactobacilli were sensitive to β-lactamade inhibitors and macrolides whereas resistant to tinidazole. Therefore, the susceptibility to some antibiotics presented similar. On the other hand, the sensitivity to other antibiotics depended on strains. Our results indicated that resistant strains of lactobacilli against tinidazole could be combinated with tinidazole for the restoration of the normal urogenital flora and curing of urinary tract infections or bacterial vaginosis.
Well-covered graphs and greedoids
Authors: Vadim E. Levit, Eugen Mandrescu
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S &isin; &Psi; (G), if S is a maximum stable set of the subgraph induced by S &cup; N(S), where N(S) is the neighborhood of S. In 2002 we have proved that &Psi;(G) is a greedoid for every forest G. The bipartite graphs and the triangle-free graphs, whose families of local maximum stable sets form greedoids were characterized by Levit and Mandrescu (2003, 2007a). In this paper we demonstrate that if a graph G has a perfect matching consisting of only pendant edges, then &Psi;(G) forms a greedoid on its vertex set. In particular, we infer that &Psi;(G) forms a greedoid for every well-covered graph G of girth at least 6, non-isomorphic to C7.
Using an MDE Approach for Modeling of Interconnection Networks
Authors: Imran Rafiq Quadri, Pierre Boulet, Samy Meftali, Jean-Luc Dekeyser
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

As System-on-Chip (SoCs) become more complex, highperformance interconnection mediums are required to handle their complexity. Network-on-Chips (NoCs) enable integration of more Intellectual Properties (IPs) into theSoC with increased performance. In the recent MARTE(Modeling and Analysis of Real-time and EmbeddedSystems) Profile, a notion of multidimensional multiplicity has been proposed to model repetitive structures and topologies. This paper presents a modeling methodology based on that notation to model the Delta Network family of Interconnection Networks for NoC construction.
Knowledge Management Revisited
Authors: Robert R. Hoffman, David Ziebell, Stephen M. Fiore, Irma Becerra-Fernandez
Venue: IEEE Intelligent Systems (2008)

A number of social, economic, technological, and scientific trends have led to the emergence of communities of practice centered on the notion of the knowledge-based organization. Workforce mobility and its implications for transfer of expertise have made knowledge management a hot topic ever since this HCC department last discussed it. The authors point to new areas of application that the commercial enterprises of KM software solutions and knowledge networking might explore. Furthermore, the scientific foundations of knowledge elicitation methodology must be expanded in scope and capability. In discussing issues of knowledge finding, knowledge elicitation, mentoring, and costing, the authors ask whether each is a matter of building intelligent technologies or of using technology intelligently.
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
Authors: Andreas Krause, Ajit Singh, Carlos Guestrin
Venue: The Journal of Machine Learning Research (2008)

When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to address this task, for example, geometry or disk models, placing sensors at the points of highest entropy (variance) in the GP model, and A-, D-, or E-optimal design. In this paper, we tackle the combinatorial optimization problem of maximizing the mutual information between the chosen locations and the locations which are not selected. We prove that the problem of finding the configuration that maximizes mutual information is NP-complete. To address this issue, we describe a polynomial-time approximation that is within (1-1/e) of the optimum by exploiting the submodularity of mutual information. We also show how submodularity can be used to obtain online bounds, and design branch and bound search procedures. We then extend our algorithm to exploit lazy evaluations and local structure in the GP, yielding significant speedups. We also extend our approach to find placements which are robust against node failures and uncertainties in the model. These extensions are again associated with rigorous theoretical approximation guarantees, exploiting the submodularity of the objective function. We demonstrate the advantages of our approach towards optimizing mutual information in a very extensive empirical study on two real-world data sets.
Development and application of internet-based remote monitoring and diagnostic platform for key equipment
Authors: Haibin Yu, Yanfeng Li, Qianjin Guo, Aidong Xu
Venue: International Journal of Computer Integrated Manufacturing (2007)

Requirements for high efficiency in manufacturing, while pushing the development of key equipment, need high-performance maintenance as a safeguard. Internet-related techniques are enabling remote monitoring and maintenance to extend beyond local areas. Considering the need for software architecture with openness and interchangeability for flexible selection and replacement of data analysis techniques, this research develops a standardized multi-layer platform using Web Services, realizing data transmission among networks. The independence between the software platform and data analysis guarantees their research and development in parallel. Studies were done on nonlinear-data-analysis techniques, such as wavelet neural networks for fault diagnostics, particle filters for estimates, and support vector regression for condition prediction. These studies were included in a comprehensive application. The experimental results support condition-based maintenance for key equipment.
Letters: A new fuzzy approach for handling class labels in canonical correlation analysis
Authors: Yanyan Liu, Xiuping Liu, Zhixun Su
Venue: Neurocomputing (2008)

Canonical correlation analysis (CCA) can extract more discriminative features by utilizing class labels, especially the ones that can reflect the sample distribution appropriately. In this paper, a new fuzzy approach for handling class labels in the form of fuzzy membership degrees is proposed. We elaborately design a novel fuzzy membership function to represent the distribution of image samples. These fuzzy class labels promote the classification performances of CCA and kernel CCA (KCCA) through incorporating distribution information into the process of feature extraction. Comprehensive experimental results on face recognition demonstrate the effectiveness and feasibility of the proposed method.
Analog SPICE behavioral model for digital I/O pin based on IBIS model
Authors: Won-Ok Kwon, Kyoung Park, Pyung Choi, Chang-Gean Woo
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

IBIS (I/O buffer information specification) model is widely used in signal integrity analysis of on-board high-speed digital systems. But many other circuit level simulations require conversion of given IBIS model to equivalent SPICE behavioral model. In this paper, curve-fitting non-linear model algorithm is proposed to extract more accurate switching time coefficients from pullup and pulldown transistors at IBIS model which has only one-pair voltage-time table. This algorithm is originated CMOS inverter switching operating characteristics. The equivalent SPICE behavioral model can be built with these extracted switching time coefficients and the proposed algorithm is verified through SPICE simulation.
Beyond attention: the role of deictic gesture in intention recognition in multimodal conversational interfaces
Authors: Shaolin Qu, Joyce Y. Chai
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

In a multimodal conversational interface supporting speech and deictic gesture, deictic gestures on the graphical display have been traditionally used to identify user attention, for example, through reference resolution. Since the context of the identified attention can potentially constrain the associated intention, our hypothesis is that deictic gestures can go beyond attention and apply to intention recognition. Driven by this assumption, this paper systematically investigates the role of deictic gestures in intention recognition. We experiment with different model-based methods and instancebased methods to incorporate gestural information for intention recognition. We examine the effects of utilizing gestural information in two different processing stages: speech recognition stage and language understanding stage. Our empirical results have shown that utilizing gestural information improves intention recognition. The performance is further improved when gestures are incorporated in both speech recognition and language understanding stages compared to either stage alone.
Sphere Detection in MIMO Communication Systems with Imperfect Channel State Information
Authors: Ahmad Ali Farhoodi, Mohammad Fazaelifar
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Capacity of wireless communication systems can be increased enormously using arrays of antenna at transmitter and receiver. In these so called multi-input multi-output (MIMO) communication systems, the performance of symbol detection methods is tightly related to the channel knowledge at the receiver side. Practically, the channel information at the receiver is subjected to error because of the outdated data, quantization error, and imperfect channel estimation/measurement. It is known that in the case of imperfect channel knowledge, performance of symbol detection in MIMO communication systems may severely degrades. In this paper, we briefly address the effect of channel estimation error on the performance of sphere detector in MIMO communication systems. We analytically propose and study two detection methods to improve the performance of sphere detector when the channel matrix is imperfectly known at receiver. In our proposed robust method, the sphere detection algorithm is modified while a small computational complexity is added to the detector.
Computer aided geometric design of strip using developable Bézier patches
Authors: Chih-Hsing Chu, Charlie C. L. Wang, Chi-Rung Tsai
Venue: Computers in Industry (2008)

Developable strip is commonly used in product design due to its ease of manufacture. This paper proposes an algorithm for geometric design of strip using developable Bezier patches. It computes an aggregate of triangular and quadrilateral patches interpolate two given space curves defining a strip. The computation process selects optimal solutions in terms of surface assessment criteria specified by the user. Each patch is then degree-elevated to gain extra degrees of freedom, which produce G1 across the patch boundaries by modifying the control points while preserving the surface developability. Test examples with different design parameters illustrate and validate the feasibility of the proposed algorithm. In comparison with previous studies, this work allows strip design with freeform developable patches, generates better results in the surface assessment, and provides more flexible control on the design shape. It serves as a simple but effective approach for computer aided geometric design of developable strip.