ppxscal/embedding_network huggingface dataset:
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
Authors: Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ "lift-and-project" method of Lovasz and Schrijver starting from the standard linear programming relaxation. Goemans and Kleinberg prove that after one round of LS+ the integrality gap remains arbitrarily close to 2. Charikar proves an integrality gap of 2, later strengthened by Hatami, Magen, and Markakis, for stronger relaxations that are, however, incomparable with two rounds of LS+. Subsequent work by Georgiou, Magen, Pitassi, and Tourlakis shows that the integrality gap remains 2 - \varepsilon after \Omega(\sqrt {\frac{{\log n}} {{\log \log n}}} ) rounds [?]. We prove that the integrality gap remains at least 7/6 - \varepsilon after c_{\varepsilon}n rounds, where n is the number of vertices and c_\varepsilon \ge 0 is a constant that depends only on \varepsilon.
On the Tolerance to Manufacturing Defects in Molecular QCA Tiles for Processing-by-wire
Authors: Jing Huang, Mariam Momenzadeh, Fabrizio Lombardi
Venue: Journal of Electronic Testing: Theory and Applications (2007)

Among emerging technologies, Quantum-dot Cellular Automata (QCA) relies on innovative computational paradigms. For nano-scale implementation, the so-called processing-by-wire (PBW) paradigm in QCA is very effective as processing takes place, while signal communication is accomplished. This paper analyzes the defect tolerance properties of PBW for manufacturing tiles by molecular QCA cells. Based on a 3¿×¿3 grid and various input/output arrangements in QCA cells, different tiles are analyzed and simulated using a coherence vector engine. The functional characterization and polarization level of these tiles for undeposited cell defects are reported and detailed profiles are provided. It is shown that novel features of PBW are possible due to the spatial redundancy of the cells in the tiles that permits to retain at high probability the fault free function in the presence of defects. Moreover, it is shown that QCA tiles are robust and inherently tolerant to cell defects (by logic equivalence, also additional cell defects can be accommodated).
Holistic Software Engineering Education Based on a Humanitarian Open Source Project
Authors: Heidi J. C. Ellis, Ralph A. Morelli, Trishan R. de Lanerolle, Gregory W. Hislop
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

For the past year, Trinity College has utilized Sahana, a free and open source disaster management system, as a foundation to teach software engineering. The goals of the use of the Sahana project are threefold: to provide students with a real-world software engineering experience; to introduce students to the open-source development model; and to attract a wider variety of students into computing due to the real-world and humanitarian nature of the Sahana project. This paper discusses an approach for using open source software as a foundation to teach software engineering in a Liberal Arts environment by involving students in an ongoing, real-world project from the very beginning, allowing students with a wide range of backgrounds to participate. Results of a learning survey of a small group of students who have participated in the project are presented. The paper also provides guidance to others contemplating incorporating open source projects into their software engineering courses or curriculum.
Ontology-based Dynamic Process Collaboration in Service-Oriented Architecture
Authors: W. T. Tsai, Qian Huang, Jingjing Xu, Yinong Chen, Ray Paul
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Service collaboration is important in Service- Oriented Architecture (SOA). While service collaboration protocols for data exchange are well explored, the Dynamic Process Collaboration (DPC) is still a challenge. DPC requires not only exchanging meaningful information between collaboration parties, but also performing collaboration workflow matching based on collaboration ontology. To do this, DPC needs service collaboration ontology modeling, service collaboration discovery and establishment based on collaboration ontology and runtime recomposition capability. This paper presents an Ontology-based Dynamic Process Collaboration (ODPC) framework with these features to facilitate DPC.
A stand-alone PC-based advising aid for students
Authors: M. Hagler
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Next to grading, student advising involves some of the most tedious and onerous tasks that faculty encounter. This paper describes a modest approach to utilizing computers to make the advising process more productive, and pleasant for both faculty and students. The advising software, which features a graphical user interface, allows students to request only courses for which they have appropriate prerequisites, corequisites and standing. The program also offers rule-based advice to students regarding special circumstances that it spots. The software is designed for straightforward modification, without programming, to accommodate addition or deletion of courses, prerequisites, corequisites and rules.
Sourcery VSIPL++ HPEC Benchmark Performance
Authors: Jules Bergmann, Don McCoy
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Sourcery VSIPL++ is a high-performance, parallel, multi-platform implementation of the VSIPL++ standard, an open-architecture API for vector, signal, and image processing.[2] Sourcery VSIPL++ allows users to develop signal-processing applications that are portable across multiple platforms and scalable across different machine sizes. This reduces program risk by avoiding lock-in to a particular vendor, platform, or technology. It allows programs to choose the best available commercial-off-the-shelf (COTS) technology and still take advantage of the technology refresh cycle. It lowers schedule pressure by enabling development to start on low-cost commodity systems before embedded systems are even available and by allowing development to initially focus on correctness of serial algorithms before optimizing for parallel performance.
Creating colored pencil style images by drawing strokes based on boundaries of regions
Authors: H. Matsui, H. Johan, T. Nishita
Venue: Proceedings of the Computer Graphics International 2005 (2005)

A lot of non-photorealistic rendering methods have been proposed for creating an artistic image from an image. In this paper, we propose a method for creating colored pencil style images. The feature of colored pencil drawings is that, though colored pencil drawings are drawn with limited number of colors of pencils, we can express a lot of colors and gentle textures by changing the strengths when drawing strokes and by overlapping strokes of different colors. In order to realize this feature, we determine which colors of pencils to use and how deep to push the pencils (equivalent to the strength when drawing strokes), then draw several types of strokes, such as strokes for outlines, basecoats, and shading, allowing the strokes to overlap each other. When we create strokes for shading, we make their directions to align along the boundaries of regions, resulting in images that are more like drawings made by human.
Multiplierless neural networks for application to digital video
Authors: M. Cavanagh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Advances in artificial neural networks have led to several applications such as in computer-vision, image restoration, speech recognition, and pattern classification. However, for widespread practical use these and many other potential applications require large, high-speed networks implemented in efficient custom hardware. This paper investigates an important issue in the implementation of such networks, namely the avoidance of multipliers. Secondly, it evaluates their application in digital video, specifically in high-performance motion prediction and frame reconstruction. The authors discuss the multilayer perceptron and Hopfield neural networks in particular.
Service Management: An Interview with Mark Potts
Authors: Dejan Milojicic
Venue: IEEE Distributed Systems Online (2007)

Service management represents the dawn of a new software era. The time when applications ran on a small computer somewhere in the corner is long gone. Today, services run over the whole Internet. They introduce a lot of opportunities, but also a lot of management problems. Dejan interviews Mark Potts, HP fellow and chief technologist of HP's Business Technology Optimization, about these problems.
New Construction of Broardcast Graphs
Authors: Hovhannes Harutyunyan, Xiangyang Xu
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Broadcast algorithms are are very important in parallel and distributed computing. In this paper we design new sparce graphs and present a minimum time broadcast algorithms from any vertex of these graphs. A broadcast graph on n vertices is a graph which allows any vertex to broadcast in time dlog ne. A minimum broadcast graph on n vertices is a broadcast graph with the minimum number of edges over all broadcast graphs on n vertices. This minimum number of edges is denoted by B(n). Many papers have presented methods to construct broadcast graphs. Here we present a method to construct a broadcast graph on n + 1 vertices by adding a vertex to a broadcast graph on n vertices. Our general upper bound on B(n) improves the best known upper bounds for almost all odd values of n. Our broadcast algorithms are simple. Our new broadcast graphs can be combined using some of the known methods to obtain further improvements.
Distributed Adaptations to Traffic Quality Requirements
Authors: Laercio Cruvinel, Teresa Vazao, Fernando Silva
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In this paper, we present DDQoS, or Distributed Dynamic Quality of Service, a novel architecture which uses QoS-configured routers as a support layer for a distributed approach on policy-based management system. The main purpose of this work is to model and test a distributed framework for globally (in a domain network) controlling QoS traffic classes parameters, in an effort to dynamically reach the best choice for QoS-conditioning parameters in each given situation, on all impacted routers of a network. The model proposed is available for use today, and does not require base changes in the existent network elements but only the configuration of the routers and the installation of some additional components in each one. The architecture answers the needs of adaptation in the network for the generality of multimedia traffic, when the performance of this traffic is threatened by the presence of flows with less strict requisites.
Success institute: expanding the pool of under-represented minority engineering students
Authors: J. L. deDegrazia
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Engineering educators at CU-Boulder, USA, teamed with community leaders from the wider metropolitan area, are working to expand the pool of underrepresented minority students who successfully study engineering, and thereby enhance their numbers in tomorrow's engineering workforce. CU's summer Success Institute resident workshops bring African-American and Hispanic high school students to campus for multi-day, hands-on engineering experiences. The intent is to spark the curiosity of under-represented minority students about science, math and engineering; enable them to pursue technical careers; and welcome them to campus. In a parallel program, parents attend the last day to learn about high school course selection, math appreciation, admissions, financial aid, peer pressure and other university life topics.
The Co-evolution of Design and User Requirements in Knowledge Management Systems: The Case of Patent Management Systems
Authors: Tony Briggs, Bala Iyer, Paul Carlile
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Do the design requirements of a knowledge management system change over time? If so, how do these changes affect the users of the system? In this paper we explore the case of patent management systems (PAMS) to identify changes in information system design and user requirements over a 200 year period. Using a design science approach, we study 30 different implementations of PAMS across different design configurations and use scenarios. We find that while early forms of PAMS persist in updated system implementations, new design configurations co-evolved with new user requirements. We conclude by suggesting that this co-evolutionary path is not unique to PAMS and suggest that a similar co-evolution is driving the development of new World Wide Web technologies.
Using machine learning to explore human multimodal clarification strategies
Authors: Verena Rieser, Oliver Lemon
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We investigate the use of machine learning in combination with feature engineering techniques to explore human multimodal clarification strategies and the use of those strategies for dialogue systems. We learn from data collected in a Wizard-of-Oz study where different wizards could decide whether to ask a clarification request in a multimodal manner or else use speech alone. We show that there is a uniform strategy across wizards which is based on multiple features in the context. These are generic runtime features which can be implemented in dialogue systems. Our prediction models achieve a weighted f-score of 85.3% (which is a 25.5% improvement over a one-rule baseline). To assess the effects of models, feature discretisation, and selection, we also conduct a regression analysis. We then interpret and discuss the use of the learnt strategy for dialogue systems. Throughout the investigation we discuss the issues arising from using small initial Wizard-of-Oz data sets, and we show that feature engineering is an essential step when learning from such limited data.
The Development of a University-Based Forensics Training Center as a Regional Outreach and Service Activity
Authors: Rayford B. Vaughn, David A. Dampier
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper describes a university-based Forensics Training Center (FTC) established by a Department of Justice grant for the purpose of improving the ability of state and local law enforcement in the Southeastern part of the United States to address the rising incidence of computer based crime. The FTC effort is described along with supporting evidence of its need. Current and planned activities of the FTC are described.
A unified method for appearance and geometry completion of point set surfaces
Authors: Chunxia Xiao, Wenting Zheng, Yongwei Miao, Yong Zhao, Qunsheng Peng
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

This paper presents a novel approach for appearance and geometry completion over point-sampled geometry. Based on the result of surface clustering and a given texture sample, we define a global texture energy function on the point set surface for direct texture synthesis. The color texture completion is performed by minimizing a constrained global energy using the existing surface texture on the surface as the input texture sample. We convert the problem of context-based geometry completion into a task of texture completion on the surface. The geometric detail is then peeled and converted into a piece of signed gray-scale texture on the base surface of the point set surface. We fill the holes on the base surface by smoothed extrapolation and the geometric details over these patches are reconstructed by a process of gray-scale texture completion. Experiments show that our method is flexible, efficient and easy to implement. It provides a practical texture synthesis and geometry completion tool for 3D point set surfaces.
Workshop on Architecting Dependable Systems (WADS 2007)
Authors: Rogerio de Lemos, Felicita Di Giandomenico, Cristina Gacek
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

This workshop summary gives a brief overview of the workshop on "Architecting Dependable Systems" held in conjunction with DSN 2007. The main aim of this workshop is to promote cross-fertilization between the software architecture and dependability communities. We believe that both of them will benefit from clarifying approaches that have been previously tested and have succeeded as well as those that have been tried but have not yet been shown to be successful.
Soft Real-Time Scheduling on Performance Asymmetric Multicore Platforms
Authors: John M. Calandrino, Dan Baumberger, Tong Li, Scott Hahn, James H. Anderson
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

This paper discusses an approach for supporting soft real-time periodic tasks in Linux on performance asymmetric multicore platforms (AMPs). Such architectures consist of a large number of processing units on one or several chips, where each processing unit is capable of executing the same instruction set at a different performance level. We discuss deficiencies of Linux in supporting periodic real-time tasks, particularly when cores are asymmetric, and how such deficiencies were overcome. We also investigate how to provide good performance for non-real-time tasks in the presence of a real-time workload. We show that this can be done by using deferrable servers to explicitly reserve a share of each core for non-real-time tasks. This allows non-real-time tasks to have priority over real-time tasks when doing so will not cause timing requirements to be violated, thus improving non-real-time response times. Experiments show that even small deferrable servers can have a dramatic impact on non-real-time task performance.
A resilient access control scheme for secure electronic transactions
Authors: Jong-Hyeon Lee
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

There have been many studies of the management of personal secrets such as PIN codes, passwords, etc., in access control mechanisms. The leakage of personal secrets is one of the most significant problems in access control. To reduce such risks, we suggest away of authenticating customers without transferring explicit customer secrets. Furthermore, we give a secure on-line transaction scheme based on our access control mechanism. Needham gave an example of Personal Identification Number (PIN) management for banking systems [Nee97] that presented away to control PIN codes. It inspired us to develop an access control model for electronic transactions which enforces a strict role definition for personal secret generation and maintenance. We extend it to a payment model. Our scheme provides enhanced privacy for customers, nonrepudiation of origin for the customer order and payment transactions, and protection from personal secret leakage. Since it does not rely on either public key cryptosystems or auxiliary hardware such as chip cards and readers, its deployment within existing environments could be cost-effective.
Finding more null pointer bugs, but not too many
Authors: David Hovemeyer, William Pugh
Venue: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2007)

In the summer of 2006, the FindBugs project was challenged to improve the null pointer analysis in FindBugs so that we could find more null pointer bugs. In particular, we were challenged to try to do as well as a publicly available analysis by Reasoning, Inc on version 4.1.24 of Apache Tomcat. Reasoning's report is a result of running their own static analysis tool and using manual auditing to remove false positives. Reasoning reported a total of 9 null pointer warnings in Tomcat 4.1.24, of which only 2 were reported by FindBugs 1.0. While we wanted to improve the analysis in FindBugs, we wanted to retain our current low level of false positives. As of result of the work presented in this paper, FindBugs now reports 4 of the 9 warnings in Tomcat, shows that one of the warnings reported by Reasoning is a false positive, and classifies the remaining 4 as being dependent on the feasibility of a particular path, which cannot be easier ascertained by a local examination of the source code. Moreover, we found 24 additional null pointer bugs in Tomcat that had been missed by Reasoning, and overall doubled the number of null pointer bugs found by FindBugs while improving the quality and significance of reported defects.
How Do Doctors Perceive the Organizing Vision for Electronic Medical Records? Preliminary Findings from a Study of EMR Adoption in Independent Physician Practices
Authors: John Lee Reardon, Elizabeth Davidson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Although there is an increasing emphasis on and investment in healthcare information technology (HIT) actual adoption and usage rates are below expectations. This research explores the role that a community-wide organizing vision (OV) [17] plays in shaping physicians' perceptions of electronic medical record (EMR) technology and hence their interest in adopting and using the technology. This paper examines the data of a survey on perceptions of a sample of independent physician practices of the OV for EMRs. The study was conducted using a mail survey of independent physician practices and uses factor analysis to examine structural properties and content of the OV among the physicians sampled. Theoretical contributions include exploring the applicability of Ramiller and Swanson's [17, 19, 20] OV on HIT innovations in healthcare research.
A construction for large sets of disjoint Kirkman triple systems
Authors: Lijun Ji
Venue: Designs, Codes and Cryptography (2007)

A Steiner system S(t, k, v) is called i-resolvable, 0 < i < t, if its block set can be partitioned into S(i, k, v). In this paper, a 2-resolvable S(3, 4, v) is used to construct a large set of disjoint Kirkman triple systems of order 3v ¿ 3 (briefly LKTS) and some new orders for LKTS are then obtained.
Web services discovery based on schema matching
Authors: Yanan Hao, Yanchun Zhang
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

A web service is programmatically available application logic exposed over Internet. With the rapid development of e-commerce over Internet, web services have attracted much attention in recent years. Nowadays, enterprises are able to outsource their internal business processes as services and make them accessible via the Web. Then they can dynamically combine individual services to provide new value-added services. A main problem that remains is how to discover desired web services. In this paper, we propose a novel web services discovery strategy given a textual description of services. In particularly, we propose a new schema matching algorithm for supporting web-service operations matching. The matching algorithm catches not only structures, but also semantic information of schemas. We also propose a ranking strategy to satisfy a user's top-k requirements. Experimental evaluation shows that our approach can achieve high precision and recall ratio.