ppxscal/embedding_network huggingface dataset:
Genus g graphs have pagenumber O( square root g)
Authors: S. M. Malitz
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A book embedding of a graph consists of a linear ordering of the vertices along the spine of a book and an assignment of edges to pages so that edges on the same page do not intersect. The minimum number of pages in which a graph can be embedded is its pagenumber. The following results are presented: (1) any graph of genus g has pagenumber O( square root g); and (2) most n-vertex d-regular graphs have pagenumber Omega ( square root dn/sup 1/2-1/d/).
Evaluation of art museums' web sites worldwide
Authors: John Pallas Anastasios A. Economides
Venue: Information Services and Use (2008)

Nowadays, it is widely observed a constantly growing number of online museums. At the same time, many studies argued that evaluation is the major tool in the effort of designing informative, effective and qualitative web sites. This paper introduces MUSEF (Museum's Sites Evaluation Framework), a framework for evaluating museums' sites from the users' point of view, and applies it to evaluate 210 art museums' web sites worldwide. MUSEF is composed from six fundamental evaluation dimensions: Content, Presentation, Usability, Interactivity & Feedback, e-Services and Technical. Each evaluation dimension contains several important criteria. The evaluation results revealed that most sites needed improvement with respect to Interactivity & Feedback and e-Services. There were also large variations among the sites with respect to Presentation, Usability and e-Services. Finally, suggestions for improvements are made.
Optimal design of DPCM scheme for ECG signal handling
Authors: H. B. Bahar, Y. S. Khiabani
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

Differential pulse code modulation (DPCM) plays an important role in communication systems. In this paper, a theoretical work has been significantly carried out to design an optimal DPCM system. At DPCM structure, instead of direct coding of signal, difference between two signals, input to DPCM and output of predictor is encoded. The difference of two signals is so small in value that can be quantized by fewer bits. In this study, Levinson-Durbin algorithm is utilized to design the optimum predictor. Furthermore, classical and Lloyd methods are used to determine quantizer levels. The designed predictor should be coordinated with designed quantizer unit which is used to implement an optimum DPCM scheme. Finally, some simulations have been implemented to evaluate performance of different structures for DPCM system and to choose the best structure with least complexity and distortion. These simulations show the effectiveness of Designed scheme for ECG signal transmission.
A geometric correction method for projected images using SIFT feature points
Authors: Toru Takahashi, Norihito Numa, Takafumi Aoki, Satoshi Kondo
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

This paper proposes a geometric correction method for projected images using SIFT feature points. A projected image correction method based on projector-camera system needs to obtain the correspondence between projector and camera images, which is obtained by projecting the special patterns on a screen. The special patterns must be re-projected when changing the environment, e.g., the projector or screen is moved. On the other hand, this paper proposes a geometric correction method using SIFT feature points on a projected image which does not employ any special patterns to obtain the correspondence between projector and camera images. Experimental result shows that the use of our proposed method makes it possible to correct distortion of projected images with only one snapshot.
Who, what, where & when: a new approach to mobile search
Authors: Karen Church, Barry Smyth
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Mobile devices and the mobile Internet represent an extremely challenging search environment. Limited screenspace, restricted text-input and interactivity, and impatient users all conspire to exacerbate the shortcomings of modern Web search. Recently researchers have proposed that typically vague search queries be augmented by context information, as a way to help search engines to retrieve more relevant information. In this paper we propose a novel interface to support multi-dimensional, context-sensitive mobile search, combining context features such as location, time, and community preferences to offer a unique search experience that is well-adapted to the needs of mobile users.
An InGaAs/GaAs superlattice-base heterostructure-emitter bipolar transistor (SB-HEBT)
Authors: Jung-Hui Tsai, Der-Feng Guo, I-Hsuan Hsu, Chien-Ming Li, Yi-Zhen Wu, Ning-Xing Su, Yin-Shan Huang
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

A novel InGaAs/GaAs superlattice-base heterostructure-emitter bipolar transistor (SB-HEBT) with structure is proposed and demonstrated by two-dimensional analysis. As compared to the traditional HEBT, the studied superlattice-base device exhibits a higher collector current, a higher current gain of 246 and a lower base-emitter (B-E) turn-on voltage of 16 mV attributed to the increased charge storage of minority carriers in the InGaAs/GaAs superlattice-base region by tunneling behavior. The low turn-on voltage can reduce the operating voltage and collector-emitter offset voltage for low power consumption in circuit applications.
Allowing Cycle References by Introducing Controlled Violations of the Assignment Rules in Real-Time Java
Authors: M. Teresa Higuera-Toledano
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The Real-time Specification for Java (RTSJ) extends the Java memory model through immortal and scoped memory regions to reduce the timing-indeterminism caused by garbage collection. Since scoped regions can be nested, RTSJ imposes strict assignment rules to avoid dangling pointers. These rules stabilise that an object shall not reference any object whose lifetime could be shorter than they own. Then references among two objects within different scoped regions are allowed only in one direction (i.e., from objects within region r1 to region r2, but never from r2 to r1). In order to support RTSJ component-based applications, we require controlled violations of the assignment rules to have bidirectional references among objects within two different scopes.
Analysis of Queueing Property for Self-Similar Traffic
Authors: Takuo Nakashima, Toshinori Sueyoshi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The scale-invariant burstiness or self-similarity has been found in real network. Relation between self-similarity and network parameter is mainly discussed in the context of application layer, and this self-similarity is caused by the file size of Web servers or the duration of user sessions. Traffic dynamics, however, are mainly generated by physical conditions such as the resource restrainment and the queue size on intermediate routers. The purpose of this research is to provide the basic concept of resource provisioning. In this paper, we have investigated queueing property on the bottleneck link for self-similar traffic using network simulator. We examined the distribution property of Pareto distribution on ns-2 simulator, then analyzing the simulated results, following properties were extracted. Firstly, the traffics with self-similar property are transmitted consuming the queue resources less on the bottleneck link. Secondly, queueing dynamics tend to exceed the linear manner for increase of packet flows. Thirdly, bandwidth expansion improve the consumption of the bottleneck queue while small delay does not affect to consume the queue. Finally, the effective throughput performance gain is measured under the restricted resource conditions.
An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing
Authors: Aydin O. Balkan, Gang Qu, Uzi Vishkin
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Single-chip parallel processing requires high bandwidth between processors and on-chip memory modules. A recently proposed Mesh-of-Trees (MoT) network provides high throughput and low latency at relatively high area cost. In this paper, we introduce a hybrid MoT-BF network that combines MoT network with the area efficient butterfly network. We prove that the hybrid network reduces MoT network's area cost. Cycle-accurate simulation and post-layout results all show that significant area reduction can be achieved with negligible performance degradation, when operating at same clock rate.
Coloring of trees with minimum sum of colors
Authors: Tao Jiang, Douglas B. West
Venue: Journal of Graph Theory (1999)

The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree with strength k that has maximum degree only 2k - 2. The result is best possible. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 354&ndash;358, 1999
Confidence in software cost estimation results based on MMRE and PRED
Authors: Marcel Korte, Dan Port
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

Bootstrapping is used to approximate the standard error and 95% confidence intervals of MMRE and PRED for a number of COCOMO I model variations applied to four PROMISE data sets. This is used to illustrate a lack of confidence in numerous published cost estimation research results based on MMRE and PRED comparisons such as model selection. We show that many such results are of questionable significance due to large possible variations resulting from population sampling error and suggest that a number of inconsistent and contradictory results may be explained by this. By using more standard statistical approaches that account for standard error, we may reduce the incidence of this and obtain greater confidence cost estimation in research results.
Temperature Control for the Thermal Cycling of Polymerase Chain Reaction
Authors: Jinhe Wang, Nan Zhang
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

DNA is a double-stranded chain of nucleotides, in order to make a huge number of copies of DNA segments, polymerase chain reaction (PCR) is the easy method for generating copies of DNA by rapid heating and cooling controlled automatically. Based on the properties of the thermal cycling of PCR, a rational approach for the temperature control of the PCR device is proposed, it consists of Feed-forward, Bang-bang and adaptive PID controller. The experimental results demonstrate that the proposed control method is more stable and efficient.
An integrated approach to video retrieval
Authors: Liang-Hua Chen, Kuo-Hao Chin, Hong-Yuan Liao
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

The usefulness of a video database depends on whether the video of interest can be easily located. In this paper, we propose a video retrieval algorithm based on the integration of several visual cues. In contrast to key-frame based representation of shot, our approach analyzes all frames within a shot to construct a compact representation of video shot. In the video matching step, by integrating the color and motion features, a similarity measure is defined to locate the occurrence of similar video clips in the database. Therefore, our approach is able to fully exploit the spatio-temporal information contained in video. Experimental results indicate that the proposed approach is effective and outperforms some existing technique.
An approach to finding weak regions for wireless sensor networks with arbitrary sensing areas
Authors: GaoJun Fan, Shiyao Jin, Wei Cheng
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

This work considers the area coverage problem in wireless sensor networks with any arbitrary sensing shape. The task is to find the weak sub-regions deteriorating the overall coverage performance. By transforming the area coverage problem to the intersection points and vertices' coverage problem, we present an approach to evaluating and improving the performance of the coverage.
Chipping away at P vs NP: how far are we from proving circuit size lower bounds?
Authors: Eric Allender
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

Many people are pessimistic about seeing a resolution to the P vs NP question any time soon. This pessimism extends also to questions about other important complexity classes, including two classes that will be the focus of this talk: TC0 and NC1. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A nanoscale nonvolatile memory device made from RbAg4I5 solid electrolyte grown on a Si substrate
Authors: X. F. Liang, Y. Chen, B. Yang, J. Yin, Z. G. Liu
Venue: Microelectronic Engineering (2008)

A nanoscale nonvolatile memory device made from RbAg"4I"5 solid electrolyte has been made directly on a Si substrate with lateral size scaled down to 100nm. By applying voltages with different polarity, the device could be switched between high- and low-resistance states. The ratio between the high and low resistances could reach ~10^3, and the low-resistance state showed rectifying diode characteristics. The configured resistances remained nonvolatile after switching, and the device could be switched repeatedly for ~10^3 times. Our results show that the nanoscale nonvolatile memory device can be integrated directly with Si-based circuit and can be potentially used for high-density memory application.
LGF: A flexible framework for exposing legacy codes as services
Authors: Bartosz Bali, Marian Bubak, Michal Wegiel
Venue: Future Generation Computer Systems (2008)

Scientific applications, usually written in Fortran or C, need to be adapted to work in modern environments for conducting scientific computations, which are based on web services or components. This work presents a Legacy to Grid framework (LGF) which enables semi-automatic virtualization of legacy codes as grid services. In contrast to existing work, LGF goes beyond a simple adapter-pattern approach; it follows a two-tier design in which the adaptation service layer is loosely coupled with the legacy back end layer. We present the architecture of our framework, its basic operation, and its capabilities: support for different interaction patterns with a legacy code and for computation migration to enable fault-tolerance and dynamic load balancing of legacy codes. We also present a case study of our framework's usage. We conclude with an evaluation of the impact of the two-layer architecture on the application's performance and the tradeoff between flexibility and performance by measuring the overhead of virtualization for different granularities of the legacy code.
A descent method for structured monotone variational inequalities
Authors: Cai-Hong Ye, Xiao-Ming Yuan
Venue: Optimization Methods Software (2007)

This article presents a descent method for solving monotone variational inequalities with separate structures. The descent direction is derived from the well-known alternating directions method. The optimal step size along the descent direction also improves the efficiency of the new method. Some numerical results demonstrate that the new method is effective in practice.
XROOTD/TXNetFile: a highly scalable architecture for data access in the ROOT environment
Authors: Alvise Dorigo, Peter Elmer, Fabrizio Furano, Andrew Hanushevsky
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

When dealing with the concurrent access from a multitude of clients to petabyte-scale data repositories, high performance, fault tolerance, robustness, and scalability are four very important issues. This paper describes the choices and the work done to address the high demand data access needs of modern physics experiments, such as the BaBar experiment at SLAC, and of any other field in which a reliable data access is a primary issue. For this purpose a highly scalable architecture has been designed and deployed which allows thousands of batch jobs and interactive sessions to effectively access the data repositories with as few fails as possible.
A sampling theorem for non-bandlimited signals using generalized Sinc functions
Authors: Qiuhui Chen, Yanbo Wang, Yi Wang
Venue: Computers Mathematics with Applications (2008)

A ladder shaped filter of two real parameters a"1,a"2@?(-1,1) is introduced in this note. The impulse response of the corresponding Linear Time Invariant (LTI) system is a generalized Sinc function of two parameters. Consequently a generalized Shannon-type sampling theorem is established for a class of non-bandlimited signals with special spectrum properties associated with a ladder shaped filter of two parameters. Finally, a mathematical characterization for the class of non-bandlimited signals satisfying the generalized sampling theorem is offered. These signals are restrictions to the real line of certain analytic functions in stripped domains symmetric about the real axis in the complex plane. For these signals, their spectra in higher frequency bands are measured by the spectrum of their base bands.
Queueing Modelling Fundamentals: With Applications in Communication Networks, 2 edition
Authors: Chee-Hock Ng, Soong Boon-Hee
Venue:  (2008)

Queueing analysis is a vital tool used in the evaluation of system performance. Applications of queueing analysis cover a wide spectrum from bank automated teller machines to transportation and communications data networks. Fully revised, this second edition of a popular book contains the significant addition of a new chapter on Flow & Congestion Control and a section on Network Calculus among other new sections that have been added to remaining chapters. An introductory text, Queueing Modelling Fundamentals focuses on queueing modelling techniques and applications of data networks, examining the underlying principles of isolated queueing systems. This book introduces the complex queueing theory in simple language/proofs to enable the reader to quickly pick up an overview to queueing theory without utilizing the diverse necessary mathematical tools. It incorporates a rich set of worked examples on its applications to communication networks. Features include: Fully revised and updated edition with significant new chapter on Flow and Congestion Control as-well-as a new section on Network Calculus A comprehensive text which highlights both the theoretical models and their applications through a rich set of worked examples, examples of applications to data networks and performance curves Provides an insight into the underlying queuing principles and features step-by-step derivation of queueing results Written by experienced Professors in the field Queueing Modelling Fundamentals is an introductory text for undergraduate or entry-level post-graduate students who are taking courses on network performance analysis as well as those practicing network administrators who want to understand the essentials of network operations. The detailed step-by-step derivation of queueing results also makes it an excellent text for professional engineers.
Its Much More Fun With Two: Mans Confusing and Hilarious Journey Through the Internet Dating Game
Authors: Richard Alexander
Venue:  (2007)

Have you ever wondered why most books on dating and personal relationships are written by women, primarily for women? Well this one is different. It's written by a man and combines his own, often hilarious experiences, on the dating scene with some really good practical advice for men new to internet dating. So if you have just lost a long term relationship for whatever reason and are feeling down and out of practice, then read this book. Then you can re launch or even re invent yourself and most of all have fun. All is not lost for women readers too as the wise ones will realise that this book gives a real insight into the male mind and the differences between the sexes. So ladies if you really want to understand men get reading!
Static path conditions for Java
Authors: Christian Hammer, Rüdiger Schaade, Gregor Snelting
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

A static path condition is a precise necessary condition for information flow between two program points. Previous work defined path conditions for procedural languages. Object oriented languages offer additional constructs such as dynamic dispatch, instanceof and exceptions. In this paper, we present an analysis of these constructs, which leads to precise path conditions operating only on the program's variables. This yields a gain in precision, allowing leverage of automatic constraint solving. We present details of path condition generation for Java constructs, and discuss preliminary insight from our prototype implementation.
On Capturing Semantics in Ontology Mapping
Authors: Bo Hu, Bin Hu
Venue: World Wide Web (2008)

Semantic interoperability between disparate systems in open, distributed environments has become the quest of many practitioners in a variety of fields. One way to achieve such a goal is through ontology mapping. The perspective users of such technology, however, are faced with a number of challenges including ambiguity of the meaning of mappings, difficulties of capturing semantics, choice of the right ontology mapping tools, verification and validation of results and operationalisation in the beneficiary semantic web application. In this paper we present a formalisation of ontologies and a triangle model for the ontology mapping problems. This formalisation of ontology mapping reflects the engineering steps needed to materialise a versatile mapping system in order to faithfully re-capture the semantics embodied in ontologies which is the fundamental requirements posed by the semantic web environment. We further accommodate this formalisation with a series of specialist algorithms targeting at particular aspects of semantic capturing. Finally, we evaluated the proposed algorithms by way of ontology mapping benchmark tests.
Bridging the Divide: Building Asia-Pacific Capacity for Effective Reforms
Authors: Rohan Samarajiva, Sujata Gamage
Venue: The Information Society (2007)

This article spotlights the need to develop capacity for ICT policy and regulation within developing countries. It argues that capacity should to be developed among all stakeholders, not solely within government agencies, because that would enable effective participation by many players in the regulatory process. The resulting participatory regulatory process will in turn increase accountability and procedural legitimacy. The article examines different approaches to developing in situ expertise, especially just-in-time learning and open-source research.