ppxscal/embedding_network huggingface dataset:
A novel method to fabricate single crystal nano beams with (111)-oriented Si micromachining
Authors: Heng Yang, Kefeng Xu, Yongliang Yang, Tie Li, Jiwei Jiao, Xinxin Li, Yuelin Wang
Venue: Microsystem Technologies (2008)

Single crystal beams made by (111)-oriented Si micromachining are usually anchored to the substrate directly. It is difficult to use the beams as resonators, since they are electrically connected to the substrate. This paper presents a modified process to fabricate single crystal nano beams which are electrically isolated from the substrate. In this process, the single crystal nano beams are fully released from the substrate and mechanically supported by metal wires, which also serve as electrical connections. The metal wires are much stiffer than the beams and do not degrade the mechanical properties of the beam according to simulations. The length and width of the beams are determined by photolithography. The thickness of the beam and the gap between the beam and the substrate are determined by the dry etching and KOH etching processes. The influence of KOH etching on the beam thickness is documented through ongoing experiments. At present, the double clamped beams and the cantilever beams have been fabricated. The thinnest beam to date was measured to be 47&#x00a0;nm. The resistance between the beam and the substrate was measured to be 214G&#x03a9;, while the resistance of a 147&#x00a0;nm-thick beam was measured to be 816&#x00a0;&#x03a9;. The surface roughness of the (111) plane is also discussed. The RMS surface roughness of the nano beam was measured to be 1.08&#x00a0;nm in an area of 5&#x00a0;&#x03bc;m&#x00a0;&#x00d7;&#x00a0;5&#x00a0;&#x03bc;m, which was etched with 45%wt. KOH at 50&#x00b0;C.
Boundary estimates for solutions of non-homogeneous boundary value problems on graphs
Authors: Sonja Currie, Bruce A. Watson
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

We consider the Sturm-Liouville operator on a graph and give bounds for the norms of the boundary values of solutions to the non-homogeneous boundary value problem in terms of the norm of the non-homogeneity. In addition the eigenparameter dependence of these bounds is studied.
Wireless ad hoc podcasting
Authors: Vincent Lenders, Martin May, Gunnar Karlsson, Clemens Wacha
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

Podcasting has become a very popular and successful Internet service in a short time. This success illustrates the interest for participatory broadcasting, in its actual form however, podcasting is only available with fixed infrastructure support to retrieve publicized episodes. We aim at releasing this limitation and present herein our podcasting system architecture together with a prototype implementation based on opportunistic wireless networking that allows us to extend podcasting to ad hoc domains.
Cross-Layer Response Surface Methodology Applied to Wireless Mesh Network VoIP Call Capacity
Authors: Vineet Kulkarni, Michael Devetsikiotis
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Wireless Mesh networking is a recent technology proposed to extend and improve the Wireless LAN capabilities to even larger geographical areas. Parallel advances in network-delivered services have created a situation where more and more end-users will want to use richer services based on the network. However, wireless networks have capacity bottlenecks due to reasons of their broadcast nature, MAC layer constraints among others. The paradigm of cross-layer design is especially relevant in wireless networks so as to effect key optimizations to improve performance. In this paper, we look at the specific service of Voiceover IP over Wireless Mesh Networks and quantify the capacity constraints using algebraic functions, fit to experimental(simulation) results. We use the Response Surface Methodology for this purpose. We also look at how application level parameters can be adapted to MAC level parameters so as to improve total call capacity, by use of our cross layer “metamodel.”
Current-sensing and repeater hybrid circuit technique for on-chip interconnects
Authors: Atul Maheshwari, Wayne Burleson
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

In this paper, hybrids based on current-sensing and repeaters are proposed for on-chip interconnects in an effort to overcome the limitations of these techniques. A novel receiver for current-sensing results in static power savings and allows an easier transition from current-sensing to traditional full rail voltage signals. Measurements of hybrids on a 0.18-µm CMOS technology show significant gains over repeater insertion in delay across wire lengths. Hybrids can also be used in placement constrained and low-noise scenarios to achieve delay and power benefits.
Understanding the Emerging C2C Electronic Market in China: An Experience-Seeking Social Marketplace
Authors: Jin Chen, Cheng Zhang, YuFei Yuan, Lihua Huang
Venue: Electronic Markets (2007)

China's consumer-to-consumer (C2C) electronic market has been growing very rapidly. The largest Chinese online auction company. Eachnet. was purchased by eBay but faced tough competition from a new Chinese online auction company, Taobao. Now Taobao's market share is twice as large as eBay's. Why has eBay quickly lost its market share to the newly launched Taobao? What is the nature of this market? On the premise of the customer relationship management (CRM) process model, we conduct a case study to describe the whole picture of this market and to find out what strategies are most suitable to the current Chinese market and likely to lead to success. Our study shows that the C2C market in China is a young and experience-seeking market whose customers are price-sensitive, willing to try new services and new vendors, and comfortable with switching. The market is also a social environment where customers' loyalty to a vendor can be built more easily by the vendor's social relation management service than by the transaction service. The findings suggest that vendors in China's C2C market should not only provide a functional service to acquire customers, but also foster the development of social marketing to retain customer loyalty. The social marketing design should be tailored to Chinese culture.
A Survey on Trust and Reputation Schemes in Ad Hoc Networks
Authors: Marianne A. Azer, Sherif M. El-Kassas, Abdel Wahab F. Hassan, Magdy S. El-Soudani
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The dynamic and cooperative nature of ad hoc networks present substantial challenges in securing these networks. There is a natural incentive for nodes to only consume, but not contribute to the services of the system. Intentional misbehavior can aim at an advantage for the misbehaving node or just constitute vandalism, such as enabling a malicious node to mount an attack or a selfish node to save power. The use of reputation systems in many different areas of IT is increasing because of their widely publicized use in online auctions and product reviews. Reputation systems are used to decide who to trust, and to encourage trustworthy behavior. In this paper we introduce the concept, goals, features and architecture of reputation systems and survey the reputation and trust based security schemes that were proposed for ad hoc networks. Finally we conclude this paper.
Revisiting multimedia streaming in mobile ad hoc networks
Authors: Peng Xue, Surendar Chandra
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Mobile ad hoc networks have been the subject of active research for a number of years. This paper investigates the feasibility of using such networks for transmitting multimedia streams. We observe that wireless network IO operations can be expensive (e.g., programmed IO cost, energy to operate wireless). Moreover, compared to nodes in infrastructure networks that either read or write network traffic, ad hoc traffic requires the intermediate node to perform many expensive network operations twice (read and then resend) and on behalf of other nodes. This observation raises an important question for the ad hoc community, should they a) demand that ad hoc routers support some minimum hardware resources (for example, full DMA support, twice the battery capacity)?, b) force an end-to-end resource management scheme that cooperatively reduces the network flow to half of what can be serviced by the weakest link? This would ensure that no intermediate node would see enough traffic to overwhelm them? or c) require that the local nodes protect themselves from transit traffic? This paper explores the last mechanism in order to provide some control over the resource consumed without a major revamp of existing operating systems or requiring special hardware. We implement our mechanism in the network driver and present encouraging preliminary results.
Latent dirichlet allocation based multi-document summarization
Authors: Rachit Arora, Balaraman Ravindran
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

Extraction based Multi-Document Summarization Algorithms consist of choosing sentences from the documents using some weighting mechanism and combining them into a summary. In this article we use Latent Dirichlet Allocation to capture the events being covered by the documents and form the summary with sentences representing these different events. Our approach is distinguished from existing approaches in that we use mixture models to capture the topics and pick up the sentences without paying attention to the details of grammar and structure of the documents. Finally we present the evaluation of the algorithms on the DUC 2002 Corpus multi-document summarization tasks using the ROUGE evaluator to evaluate the summaries. Compared to DUC 2002 winners, our algorithms gave significantly better ROUGE-1 recall measures.
Introduction to Linux, 2 edition
Authors: Machtelt,  Garrels
Venue:  (2007)

Whether you're just starting out with Linux or looking to hone your existing skills, this book will provide you with the knowledge you need.
User Profile Modeling in the context of web-based learning management systems
Authors: Yiouli Kritikou, Panagiotis Demestichas, Evgenia Adamopoulou, Konstantinos Demestichas, Michael Theologou, Maria Paradia
Venue: Journal of Network and Computer Applications (2008)

Over the past two decades, great research efforts have been made towards the personalization of e-learning platforms. This feature increases remarkably the quality of the provided learning services, since the users' special needs and capabilities are respected. The idea of predicting the users' preferences and adapting the e-learning platform accordingly is the focal point of this paper. In particular, this paper starts with the main requirements of an advanced e-learning system, explains the way a user navigates in such a system, presents the architecture of a corresponding e-learning system and describes its main components. Research is focused on the User Model component, its role in the e-learning system and the parameters that comprise it. In this context, Bayesian Networks are used as a tool for the encoding, learning and reasoning of probabilistic relationships, with the aim to effectively predict user preferences. In support of this vision, four different scenarios are presented, in order to test the way Bayesian Networks apply in the e-learning field.
Computational Strategies for Protein Quantitation in 2D Electrophoresis Gel Image Processor for Matlab
Authors: Umer Zeeshan Ijaz, Safee Ullah Chaudhary, Moon Sang Don, Kyung Youn Kim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In this paper, computational strategies are defined for protein quantitation by considering the shapes of the protein spots. The technique uses the clustering techniques like K-mean and fuzzy C-mean to distinguish between different types of protein spots and unwanted artifacts. The resulting technique is used in 2D Electrophoresis Gel Image Processor for Matlab with other image manipulation techniquies on the experimental data to evaluate its performance.
Parallel object monitors
Authors: Denis Caromel, Luis Mateu, Guillaume Pothier, Éric Tanter
Venue: Concurrency and Computation: Practice Experience (2008)

Coordination of parallel activities on a shared memory machine is a crucial issue for modern software, even more with the advent of multi-core processors. Unfortunately, traditional concurrency abstractions force programmers to tangle the application logic with the synchronization concern, thereby compromising understandability and reuse, and fall short when fine-grained and expressive strategies are needed. This paper presents a new concurrency abstraction called POM, parallel object monitor, supporting expressive means for coordination of parallel activities over one or more objects, while allowing a clean separation of the coordination concern from application code. Expressive and reusable strategies for concurrency control can be designed, thanks to a full access to the queue of pending requests, parallel execution of dispatched requests together with after-actions, and complete control over reentrancy. A small domain-specific aspect language is provided to adequately configure pre-packaged, off-the-shelf synchronizations. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Approximating shortest superstrings
Authors: Shang-Hua Teng
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

The Shortest Superstring Problem is to find a shortest possible string that contains every string in a given set as substrings. This problem has applications to data compression and DNA sequencing. As the problem is NP-hard and MAX SNP-hard, approximation algorithms are of interest. We present a new algorithm which always finds a superstring that is at most 2.89 times as long as the shortest superstring. Our result improves the 3-approximation result of Blum, Jiang, Li, Tromp, and Yannakakis (1991).
Bourbon Operations in China Following World War II
Authors: James David
Venue: Cryptologia (2007)

This article describes the operation of a small U.S. Navy station in post-World War II China that primarily intercepted Soviet naval traffic as part of the worldwide BOURBON project targeting all Soviet communications systems.
Maximum Resolution Topology for Online Auction Markets
Authors: James K. Ho, Sydney C. K. Chu, S. S. Lam
Venue: Electronic Markets (2007)

A topological model of an online auction market is a simultaneous graphical display of all the dimensions of its relevant database, providing a geometrical shape as a visually descriptive statistics of the market at any particular instance of its development. In particular, various dimensions were identified for constructing a multi-attribute dichotomy that can help discern relative advantages to buyers and sellers, using only available, operational data, and without expert knowledge of the items involved or the prices attained. With a reference subset of prejudged cases, the configuration of the dimensions and the angles among them can be optimized for a topology that maximizes the resolution of such dichotomies. The approach is illustrated in a global comparative study of four markets in five countries. It can be a useful tool for data mining and visualization in the design, study, and analysis of online auction markets.
Behavioural model fusion: an overview of challenges
Authors: Shiva Nejati, Marsha Chechik
Venue: Proceedings of the 2008 international workshop on Models in software engineering (2008)

In large-scale model-based development, developers periodically need to combine collections of interrelated models. These models may capture different features of a system, describe alternative perspectives on a single feature, or express ways in which different features may alter one another's structure or behaviour. We refer to the process of combining a set of interrelated models as model fusion. In this position paper, we provide an overview of our work on two key fusion activities, merging and composition, for behavioural models. The practical basis of our work comes from two case studies that we conducted using models from the telecommunications domain. We illustrate our work using these case studies, summarize the results our research has led to so far, and describe the future research challenges.
Learning diverse rankings with multi-armed bandits
Authors: Filip Radlinski, Robert Kleinberg, Thorsten Joachims
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Algorithms for learning to rank Web documents usually assume a document's relevance is independent of other documents. This leads to learned ranking functions that produce rankings with redundant results. In contrast, user studies have shown that diversity at high ranks is often preferred. We present two online learning algorithms that directly learn a diverse ranking of documents based on users' clicking behavior. We show that these algorithms minimize abandonment, or alternatively, maximize the probability that a relevant document is found in the top k positions of a ranking. Moreover, one of our algorithms asymptotically achieves optimal worst-case performance even if users' interests change.
Model eco-systems: preliminary work
Authors: Aditya Ghose, George Koliadis
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

Modeling is core software engineering practice. Conceptual models are constructed to establish an abstract understanding of the domain among stakeholders. These are then refined into computational models that aim to realize a conceptual specification. The refinement process yields sets of models that are initially incomplete and inconsistent by nature. The aim of the engineering process is to negotiate consistency and completeness toward a stable state sufficient for deployment / implementation. This paper presents the notion of a model ecosystem, which permits the capability to guide analyst edits toward stability by computing consistency and completeness equilibria for conceptual models during periods of model change.
Analysis and numerical simulation of positive and dead-core solutions of singular two-point boundary value problems
Authors: Svatoslav Stank, Gernot Pulverer, Ewa B. Weinmüller
Venue: Computers Mathematics with Applications (2008)

We investigate the solvability of the Dirichlet boundary value problem u^''(t)=@lg(u(t)),@l>=0,u(0)=1,u(1)=1, where @l is a nonnegative parameter. We discuss the existence of multiple positive solutions and show that for certain values of @l, there also exist solutions that vanish on a subinterval [@r,1-@r]@?(0,1), the so-called dead-core solutions. In order to illustrate the theoretical findings, we present computational results for g(u)=1/u, computed using the collocation method implemented in bvpsuite, a new version of the standard MATLAB code sbvp1.0.
Action synchronization in P2P system testing
Authors: Eduardo Cunha de Almeida, Gerson Sunyé, Patrick Valduriez
Venue: Proceedings of the 2008 international workshop on Data management in peer-to-peer systems (2008)

Testing peer-to-peer (P2P) systems is difficult because of the high numbers of nodes which can be heterogeneous and volatile. A test case may be composed of several ordered actions that may be executed on different nodes. To ensure action ordering and the correct behavior of the test case, a synchronization mechanism is required. In this paper, we propose a synchronization algorithm for executing test case actions in P2P systems. The main goal of the algorithm is to progressively dispatch the actions of a test case to a set of nodes and ensure that all nodes completed the execution of an action before dispatching the next one. We validated our synchronization algorithm through implementation and experimentation on an open-source P2P system. The experimentation shows how the algorithm was able to detect implementation problems on the P2P system.
An empirical analysis of open source software developers' motivation using expectancy-valence theory
Authors: James H. Gerlach
Venue:  (2007)

The purpose of this study was to investigate the motivations of individuals that are willing to join open source communities and voluntarily dedicate their effort and expertise for OSS development. Despite the emergence of various studies on developers' motivation, there is little research that focuses on developers' intentions to continue their participation and expend their effort. Expectancy-valence theory, human resource theory, and volunteerism were adapted to form two research models: a theoretical model of OSS developers' continuation, and an exploratory model of developers' effort. The continuation model captures those factors that might significantly influence OSS developers' satisfaction with OSS development, their commitment and intentions to continue participating in future open source projects, and the causal relationships among these factors. The effort model is developed to measure the associations between developers' effort and motivation, schedule availability, and expertise. The findings regarding the motivation of developers showed that volunteering can reflect multiple motivations: intrinsic motivation (i.e., helping) and extrinsic motivation (i.e., career advancement). A positive and satisfactory experience leads to a positive attitude toward retention. Moreover, volunteer developers' commitment primarily depends on motivation to help. These results, taken as a whole, suggest that OSS developers are motivated both by the altruism of helping and the economic incentive for career advancement. Developers' effort was primarily influenced by both their motivation to help and peer recognition, which implies that the impact of intrinsic motivators on effort is stronger than that of extrinsic motivators. Enjoyment demonstrated a significantly negative effect on effort, suggesting that developers with high levels of motivation on enjoyment did not spend more time on open source projects than those with less motivation on enjoyment. This study also provided empirical evidence that volunteers may vary their motivation according to their actual experience and the commercial viability of their project. The length of experience suggests a life cycle effect on motivation; i.e., the longer developers stay, the higher levels of motivation grow. In addition, the more commercially viable an open source project is, the more likely developers are motivated. Finally, scheduling availability is an important factor of predicting continuation and effort.
Design evaluation using virtual reality based prototypes: towards realistic visualization and operations
Authors: Dongsik Jo, Ungyeon Yang, Wookho Son
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this paper, we introduce a method for design evaluation of mobile devices using virtual reality based prototypes. For this, we present technologies for a classification of design parameters and for visualizing mobile devices with high quality 3D data. Also, we describe an implementation method for natural simulation and interaction of product functions.