ppxscal/embedding_network huggingface dataset:
Weakly pancyclic graphs
Authors: Stephan Brandt, Ralph Faudree, Wayne Goddard
Venue: Journal of Graph Theory (1998)

In generalizing the concept of a pancyclic graph, we say that a graph is &ldquo;weakly pancyclic&rdquo; if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic are considerably weaker than those required to ensure that it is pancyclic. This sheds some light on the content of a famous metaconjecture of Bondy. From the main result of this paper it follows that 2-connected nonbipartite graphs of sufficiently large order n with minimum degree exceeding 2n-7 are weakly pancyclic; and that graphs with minimum degree at least n-4 + 250 are pancyclic, if they contain both a triangle and a hamiltonian cycle. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 27: 141&ndash;176, 1998
Semi-autonomous micro robot control and video relay through internet and iridium networks
Authors: Robert H. Bledsoe, Ravi Vaidyanathan, Jayson Durham, Xiaoping Yun
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

This paper describes the experimental design, implementation, and testing of a network for tele-command, control, and communications of micro robots over long distances. The system utilizes commercial low bandwidth satellites to transmit near real-time video and leverages micro-robot platform synergies for command-communications relays. The system is capable of controlling micro ground vehicles and micro air vehicles (MAVs) over long distances using a small UAV as a communications relaying device. System elements meet size, power and mass constraints such that they may interface with control and power subsystems on micro robotic platforms and are scalable to control several entities simultaneously. We report the successful testing of the system in intercontinental experiments for control of both aerial and terrestrial micro robots between the Naval Postgraduate School (NPS) in Monterey, CA, USA, The University of Southampton, UK, and Space Warfare Systems Command (SPAWAR) in San Diego, CA, USA. We believe this research will serve as a proof of concept for future testing for a wide range of micro robotic command and control applications.
Improved field emission characteristic of carbon nanotubes by an Ag micro-particle intermediation layer
Authors: Wenhui Lu, Hang Song, Yixin Jin, Haifeng Zhao, Zhiming Li, Hong Jiang, Guoqing Miao
Venue: Microelectronics Journal (2008)

An efficient way to improve field emission characteristic of carbon nanotubes (CNTs) through an Ag micro-particle intermediation layer is presented. In this way, the intermediation layer is deposited on an indium tin oxide glass substrate by electrochemical method and then the CNTs are covered onto surface of the intermediation layer by electrophoretic method as CNT field emitters. The field emission characteristic of the CNT field emitters with the intermediation layer is significantly improved compared to the one without the intermediation layer, including decreased turn-on electric field from 4.2 to 3.1V/@mm and increased emission current density from 0.224 to 0.912mA/cm^2 at an applied electric field of 6V/@mm. The improved field emission characteristic may be attributed to gibbous surface of the CNT field emitters. This efficient way is much simple, low cost, and suitable for production of large scale CNTs-based field emission cold cathode.
Mean-semivariance models for fuzzy portfolio selection
Authors: Xiaoxia Huang
Venue: Journal of Computational and Applied Mathematics (2008)

This paper discusses portfolio selection problem in fuzzy environment. In the paper, semivariance is originally presented for fuzzy variable, and three properties of the semivariance are proven. Based on the concept of semivariance of fuzzy variable, two fuzzy mean-semivariance models are proposed. To solve the new models in general cases, a fuzzy simulation based genetic algorithm is presented in the paper. In addition, two numerical examples are also presented to illustrate the modelling idea and the effectiveness of the designed algorithm.
Representing Rotations and Orientations in Geometric Computing
Authors: Jehee Lee
Venue: IEEE Computer Graphics and Applications (2008)

In 3D space, orientations and rotations are not interchangeable. Therefore, we should represent them differently and appropriately.
Coarse-to-Fine Segmentation and Tracking Using Sobolev Active Contours
Authors: Ganesh Sundaramoorthi, Anthony Yezzi, Andrea Mennucci
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Recently proposed Sobolev active contours introduced a new paradigm for minimizing energies defined on curves by changing the traditional cost of perturbing a curve and thereby redefining their gradients. Sobolev active contours evolve more globally and are less attracted to certain intermediate local minima than traditional active contours, and it is based on a well-structured Riemannian metric. In this paper, we analyze Sobolev active contours using scale-space analysis in order to understand their evolution across different scales. This analysis shows an extremely important and useful behavior of Sobolev contours, namely, that they move successively from coarse to increasingly finer scale motions in a continuous manner. This property illustrates that one justification for using the Sobolev technique is for applications where coarse-scale deformations are preferred over fine scale deformations. Along with other properties to be discussed, the coarse-to-fine observation reveals that Sobolev active contours are, in particular, ideally suited for tracking algorithms that use active contours. We will also justify our assertion that the Sobolev metric should be used over the traditional metric for active contours in tracking problems by experimentally showing how a variety of active contour based tracking methods can be significantly improved merely by evolving the active contour according to the Sobolev method.
Process-context aware matchmaking for web service composition
Authors: Weili Han, Xingdong Shi, Ronghua Chen
Venue: Journal of Network and Computer Applications (2008)

Web service composition can help software developer design more powerful and flexible applications according to requirements of enterprise. But during compositing, how to discover suitable web services is a critical problem in design and implementing application-oriented web service technologies. The traditional keyword-based matchmaking approach is difficult to help developer to find suitable service. Current researches find that to attaching semantics to each registered service can help improve the precision of matchmaking. The improvement can help developer find more suitable service for business process. This paper proposes a novel approach of semantics-based matchmaking, which is named process-context aware matchmaking. The process-context aware matchmaking discovers the suitable service during web service composite modeling. During matchmaking, the approach utilizes not only semantics of technical process but also that of business process of a registered service, thus further improving the precision of matchmaking. We integrate the process-context aware matchmaking with business-process-driven web service composition in an integrated development environment based on Eclipse. The performance evaluation shows that performance overhead of this novel approach is acceptable.
Rate allocation for robust video streaming based on distributed video coding
Authors: R. Bernardini, M. Naccari, R. Rinaldo, M. Tagliasacchi, S. Tubaro, P. Zontone
Venue: Image Communication (2008)

This paper proposes an error resilient coding scheme that employs distributed video coding tools. A bitstream, produced by any standard motion-compensated predictive codec (MPEG-x, H.26x), is sent over an error-prone channel. In addition, a Wyner-Ziv encoded auxiliary bitstream is sent as redundant information to serve as a forward error correction code. At the decoder side, error concealed reconstructed frames are used as side information by the Wyner-Ziv decoder, and the corrected frame is used as a reference by future frames, thus reducing drift. We explicitly target the problem of rate allocation at the encoder side, by estimating the channel induced distortion in the transform domain. Rate adaptivity is achieved at the frame, subband and bitplane granularity. Experimental results conducted over a simulated error-prone channel reveal that the proposed scheme has comparable or better performance than a scheme where forward error correction codes are used. Moreover the proposed solution shows good performance when compared to a scheme that uses the intra-macroblock refresh procedure.
Mobile search: the future
Authors: Scott Weiss
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

This panel covers mobile search: what does the future have in store for us? What about marketing and advertising---how will that impact the user experience? What about voice search? Do we have to all get QWERTY (or Asian language equivalent) keypads, or will the 12-digit keypad be enough?
Is Anybody Home?
Authors: Jim Miller
Venue: IEEE Internet Computing (2008)

At the recent consumer electronics show CES the big story was about how all the devices we'll be buying in the very near future will be Internet-capable. We should think about the broader notion of an ecology of connected devices: why this notion didn't work in the past, what it'll take to make it work this time, and whatissues we, as designers of this ecology, should be thinking about as we move toward the future.
An Efficient Implementation of Distributed Routing Algorithms for NoCs
Authors: José Flich, Samuel Rodrigo, José Duato
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

The design of NoCs for multi-core chips introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are preferred, heterogeneous blocks, fabrication faults, reliability issues, and chip virtualization may lead to the need of irregular topologies or regions. In this situation, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. LBDR (Logic-Based Distributed Routing) is proposed as a new routing method that removes the need of using routing tables at all. LBDR enables the implementation of many routing algorithms on most of the practical topologies we might find in the near future in a multi-core system. From an initial topology and routing algorithm, a set of three bits per switch/output port is computed. Evaluation results show that, by using a small logic, LBDR mimics the performance of routing algorithms when implemented with routing tables, both in regular and irregular topologies.
DFM in practice: hit or hype?
Authors: Juan C. Rey, NS Nagaraj, Andrew Kahng, Fabian Klass, Rob Aitken, Cliff Hou, Luigi Capodieci, Vivek Singh
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

DFM has taken shape by virtue of manufacturers defining a series of "DFM activities", related to parametric and stochastic yield analysis and recommendations for design changes to improve yield. The picture is made more complex because the view from integrated device manufacturers, pure play foundries, and fabless semiconductor companies is not necessarily the same as they have different needs and constrains. This panel brings together DFM practitioners from each of these communities to discuss real experiences on the adoption level achieved so far as well as the impact in the manufactured products. The panel should be of interest of designers moving to advanced nodes (to learn from the experience of those that have "done it already") as well as those in the leading edge (such that they can compare experiences).
Fuzzy consensus measure on verbal opinions
Authors: Wen-Feng Hsiao, Hsin-Hui Lin, Te-Min Chang
Venue: Expert Systems with Applications: An International Journal (2008)

In the group decision-making process, consensus is an important indication of group agreement or reliability. Traditional methods to measure consensus refer mostly to gauging variance among the participants' opinions by transforming them into numbers in the interval scale. In this study we propose a new value-based measure, in which verbal opinions are transformed into values by means of fuzzy membership functions. To understand how the proposed method performs, we conduct two experiments to compare its performance with the variance-based methods and entropy measure. The results show that our method is more appropriate to account for participants' consensus judgments based on verbal opinions.
Generic Carrier-Based Core Model for Four-Terminal Double-Gate MOSFET Valid for Symmetric, Asymmetric, SOI, and Independent Gate Operation Modes
Authors: Feng Liu, Jin He, Yue Fu, Jinhua Hu, Wei Bian, Yan Song, Xing Zhang, Mansun Chan
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A generic carrier-based core model for undoped four-terminal double-gate (DG) MOSFET valid for symmetric, asymmetric, SOI, and independent gate operation modes is presented in this paper. Based on the exact solution of the 1-D Poisson’s equation of a general DG-MOSFET configure, a generic drain current model is derived from Pao-Sah’s double integral in terms of the carrier concentration. The model is verified by extensive comparisons with 2-D numerical simulations under different bias conditions to all four terminals. The concise mathematic formulation allows the unification various double-gate models into a carrier-based core model for compact DG-MOSFET model development.
An efficient and secure event signature (EASES) protocol for peer-to-peer massively multiplayer online games
Authors: Mo-Che Chan, Shun-Yun Hu, Jehn-Ruey Jiang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In recent years, massively multiplayer online games (MMOGs) have become very popular by providing more entertainment and sociability than single-player games. In order to prevent cheaters to gain unfair advantages in peer-to-peer (P2P)-based MMOGs, several cheat-proof schemes have been proposed by using digital signatures. However, digital signatures generally require a large amount of computations and thus may not be practical for interactive real-time applications such as games. Based on the concept of one-time signature, we propose an efficient and secure event signature (EASES) protocol to efficiently sign discrete event messages with hash-chain keys. As most messages need only two hash operations to achieve non-repudiation and event commitment, usage of digital signatures is greatly reduced. We also describe a dynamic version of EASES that does not require the pre-production of hash-chain keys to reduce key preparation time and memory usage at the expense of a slight delay of message commitment. As shown by both analysis and experiments, the computation, memory, and bandwidth footprints of EASES are low, making it readily applicable to P2P-based MMOGs.
Identifiability of extended latent class models with individual covariates
Authors: Antonio Forcina
Venue: Computational Statistics Data Analysis (2008)

Identifiability for a very flexible family of latent class models introduced recently is examined. These models allow for a conditional association between selected pairs of response variables conditionally on the latent and are based on logistic regression models both for the latent weights and for the conditional distributions of the response variables in terms of subject specific covariates. Generalized logits (global or continuation, which are relevant with ordered categorical responses and involve comparisons of cumulated probabilities) may be used as an alternative to the usual logits of type local which are log-linear. A compact matrix formulation for the Jacobian of the parametrization and a simple algorithm for checking local identifiability numerically is described. A few examples involving causal inference are examined.
Shape sensitive geometric monitoring
Authors: Izchak Sharfman, Assaf Schuster, Daniel Keren
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in a communication efficient manner. Specifically, we assume that each node holds a time varying input vector, and we are interested in determining, at any given time, whether the value of an arbitrary function on the average of these vectors crosses a predetermined threshold. In this paper, we introduce a new method for monitoring distributed data, which we term shape sensitive geometric monitoring. It is based on a geometric interpretation of the problem, which enables to define local constraints on the data received at the nodes. It is guaranteed that as long as none of these constraints has been violated, the value of the function does not cross the threshold. We generalize previous work on geometric monitoring, and solve two problems which seriously hampered its performance: as opposed to the constraints used so far, which depend only on the current values of the local input vectors, here we incorporate their temporal behavior into the constraints. Also, the new constraints are tailored to the geometric properties of the specific function which is being monitored, while the previous constraints were generic. Experimental results on real world data reveal that using the new geometric constraints reduces communication by up to three orders of magnitude in comparison to existing approaches, and considerably narrows the gap between existing results and a newly defined lower bound on the communication complexity.
Elementary approximation algorithms for prize collecting Steiner tree problems
Authors: Shai Gutner
Venue: Information Processing Letters (2008)

This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G=(V,E), a collection T={T"1,...,T"k}, each a subset of V of size at least 2, a weight function w:E->R^+, and a penalty function p:T->R^+. The goal is to find a forest F that minimizes the cost of the edges of F plus the penalties paid for subsets T"i whose vertices are not all connected by F. Our main result is a (3-4n)-approximation for the prize collecting generalized Steiner forest problem, where n>=2 is the number of vertices in the graph. This obviously implies the same approximation for the special case called the prize collecting Steiner forest problem (all subsets T"i are of size 2). The approximation algorithm is obtained by applying the local ratio method, and is much simpler than the best known combinatorial algorithm for this problem. Our approach gives a (2-1n-1)-approximation for the prize collecting Steiner tree problem (all subsets T"i are of size 2 and there is some root vertex r that belongs to all of them). This latter algorithm is in fact the local ratio version of the primal-dual algorithm of Goemans and Williamson [M.X. Goemans, D.P. Williamson, A general approximation technique for constrained forest problems, SIAM Journal on Computing 24 (2) (April 1995) 296-317]. Another special case of our main algorithm is Bar-Yehuda's local ratio (2-2n)-approximation for the generalized Steiner forest problem (all the penalties are infinity) [R. Bar-Yehuda, One for the price of two: a unified approach for approximating covering problems, Algorithmica 27 (2) (June 2000) 131-144]. Thus, an important contribution of this paper is in providing a natural generalization of the framework presented by Goemans and Williamson, and later by Bar-Yehuda.
Cryptographic Test Correction
Authors: Eric Levieil, David Naccache
Venue: IEEE Security and Privacy (2008)

Multiple choice questionnaires (MCQs) are an assessment procedure invented in 1914 by Frederick J. Kelly. Today, they're widely used in education, opinion polls, and elections. When the authors first encountered MCQs in the university environment, they faced the daunting challenge of having to grade 600 of them. This installment of Crypto Corner explores the possibility of safely transferring part of an MCQ's correction burden to the examinee—in this case, students—when sophisticated technological means such as optical character recognition systems aren't available.
A circuit-compatible analytical device model for ballistic nanowire transistors
Authors: Jinghong Chen
Venue: Microelectronics Journal (2008)

Silicon nanowire transistors (SNWTs) have attracted broad attention as a promising device structure for future integrated circuits. Silicon nanowires with a diameter as small as 2nm and having high carrier mobility have been achieved. Consequently, to develop TCAD tools for SNWT design and to model SNWT for circuit-level simulations have become increasingly important. This paper presents a circuit-compatible closed-form analytical model for ballistic SNWTs. Both the current-voltage (I-V) and capacitance-voltage (C-V) characteristics are modeled in terms of device parameters and terminal voltages. Such a model can be efficiently used in a conventional circuit simulator like SPICE to facilitate transistor-level simulation of large-scale nanowire or mixed nanowire-CMOS circuits and systems.
Extension of pairwise broadcast clock synchronization for multicluster sensor networks
Authors: Kyoung-Lae Noh, Yik-Chung Wu, Khalid Qaraqe, Bruce W. Suter
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Time synchronization is crucial for wireless sensor networks (WSNs) in performing a number of fundamental operations such as data coordination, power management, security, and localization. The Pairwise Broadcast Synchronization (PBS) protocol was recently proposed to minimize the number of timing messages required for global network synchronization, which enables the design of highly energy-efficient WSNs. However, PBS requires all nodes in the network to lie within the communication ranges of two leader nodes, a condition which might not be available in some applications. This paper proposes an extension of PBS to the more general class of sensor networks. Based on the hierarchical structure of the network, an energy-efficient pair selection algorithm is proposed to select the best pairwise synchronization sequence to reduce the overall energy consumption. It is shown that in a multicluster networking environment, PBS requires a far less number of timing messages than other well-known synchronization protocols and incurs no loss in synchronization accuracy. Moreover, the proposed scheme presents significant energy savings for densely deployed WSNs.