ppxscal/embedding_network huggingface dataset:
Teaching computing service courses for fun and profit
Authors: M. C. Kong
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Historically, the Computer Science Department taught a series of service courses for non-majors. These courses were intended primarily for students in the humanities and social sciences, business, natural sciences, and engineering. In 1993, computer science was merged into the Department of Electrical and Computer Engineering, immediately raising the question of whether or not the School of Engineering should be in the business of offering service courses to nonengineering students. It was finally decided to allow the new Electrical Engineering and Computer Science Department to offer the service courses with the promise of a major overhaul of the content, organization, and laboratory facilities. A faculty member was asked to be responsible for the courses. The graduate teaching assistants who teach the courses were organized, trained, and ones with poor teaching records were dismissed. New computing equipment was purchased with engineering equipment fee money. Course curricula were completely revamped. The results of the experiment have been most gratifying. Enrollment demand has increased even though the courses are now "engineering" courses. Feedback from the approximately 1800 students who take the courses annually borders on rave reviews, a considerable change from the past. This paper discusses our experience in more detail.
Recurrence relations for a Newton-like method in Banach spaces
Authors: P. K. Parida, D. K. Gupta
Venue: Journal of Computational and Applied Mathematics (2007)

The convergence of iterative methods for solving nonlinear operator equations in Banach spaces is established from the convergence of majorizing sequences. An alternative approach is developed to establish this convergence by using recurrence relations. For example, the recurrence relations are used in establishing the convergence of Newton's method [L.B. Rall, Computational Solution of Nonlinear Operator Equations, Robert E. Krieger, New York, 1979] and the third order methods such as Halley's, Chebyshev's and super Halley's [V. Candela, A. Marquina, Recurrence relations for rational cubic methods I: the Halley method, Computing 44 (1990) 169-184; V. Candela, A. Marquina, Recurrence relations for rational cubic methods II: the Halley method, Computing 45 (1990) 355-367; J.A. Ezquerro, M.A. Hernandez, Recurrence relations for Chebyshev-type methods, Appl. Math. Optim. 41 (2000) 227-236; J.M. Gutierrez, M.A. Hernandez, Third-order iterative methods for operators with bounded second derivative, J. Comput. Appl. Math. 82 (1997) 171-183; J.M. Gutierrez, M.A. Hernandez, Recurrence relations for the Super-Halley method, Comput. Math. Appl. 7(36) (1998) 1-8; M.A. Hernandez, Chebyshev's approximation algorithms and applications, Comput. Math. Appl. 41 (2001) 433-445 [10]]. In this paper, an attempt is made to use recurrence relations to establish the convergence of a third order Newton-like method used for solving a nonlinear operator equation F(x)=0, where F:@W@?X->Y be a nonlinear operator on an open convex subset @W of a Banach space X with values in a Banach space Y. Here, first we derive the recurrence relations based on two constants which depend on the operator F. Then, based on this recurrence relations a priori error bounds are obtained for the said iterative method. Finally, some numerical examples are worked out for demonstrating our approach.
LFSR Reseeding with Irreducible Polynomials
Authors: Snehal Udar, Dimitri Kagaris
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

We propose an innovative scheme for LFSR reseeding based on the efficient generation of the seeds of any non-primitive irreducible polynomial. The scheme has very small hardware overhead irrespective of the number of seeds and guarantees that the generation of the pattern subsequence from each seed is disjoint. Experimental results demonstrate the potential of the mechanism for pseudorandom test pattern generation in a parallel chain test-per-scan environment.
A Heuristic Technique for Solving Dual-Homing Assignment Problem of 2.5G Cellular Networks
Authors: Samir K. Sadhukhan, Swarup Mandal, Debashis Saha
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

2.5 cellular network topology involves grouping of NodeBs into Radio Network Controllers (RNCs), RNCs into Serving GPRS Support Nodes (SGSNs), and RNCs into Mobile Switching Centres (MSCs), so as to minimize the total cost of operation (TCO) including equipment cost, cable cost, installation cost, cost of call setup and handoff cost. The problem has been traditionally solved under single-homing consideration with an objective to reduce the TCO over a certain period of time. However, a single homing solution may not be effective with a group of subscribers having a specific diurnal pattern of their inter-SGSN mobility. In this scenario dual-homing of RNCs may be one of the approaches to reduce the TCO. In this paper, we have addressed the problem by making RNCs dual-homed. The problem is formulated as a combinatorial optimization problem and solved using a heuristic technique. The performance of the heuristic technique is compared with an exhaustive search technique for small size problems and it is found that the proposed technique is capable of finding a good quality solutions.
About the integration of Mac OS X devices into a centrally managed UNIX environment
Authors: Anton Schultschik
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

The UNIX flavors in use today have so much in common that centralized management of UNIX systems has become almost standard. Since Mac OS X is based on BSD-UNIX it is a promising candidate for integration into a centrally managed UNIX environment. Starting from generic administration concepts, this paper develops an integrated management concept that handles fully automated installation and configuration of hosts. The concept includes a centralized application management system for console and graphical Mac OS X applications. The management concept is then implemented based exclusively on standard UNIX tools. The necessary extensions of these tools to make Mac OS X conform to UNIX standards are presented, including a proxy tool to forward AppleEvents which facilitate the interprocess communication for centrally managed graphical Mac OS X applications.
What Use is Verified Software?
Authors: John Rushby
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

The world at large cares little for verified software; what it cares about are trustworthy and cost-effective systems that do their jobs well.We examine the value of verified software and of verification technology in the systems context from two perspectives, one analytic, the other synthetic. We propose some research opportunities that could enhance the contribution of the verified software initiative to the practices of systems engineering and assurance.
Market Research Design on Modeling Propensity to Purchase and Market Potential: Using GIS and Data Mining as the Tools
Authors: Lihua Zhao, Jennifer Harris
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

This paper presents the research design for an ongoing project focusing on modelling propensity to purchase and market potential estimation on a small geographic area basis through the integration of market and geo-referenced data sources. Specifically, the project seeks to use Geographical Information Systems (GIS) and Data Mining technologies as key market intelligence software tools for market forecast modelling. Using the automobile industry in Sydney as an example, the research aims to improve the use of spatial information and Census data in market research, with the outcomes expected to provide valuable information for decision makers in other industries, as well as for market researchers in general.
Hybrid evolutionary algorithm for solving general variational inequality problems
Authors: Mend-Amar Majig, Abdel-Rahman Hedar, Masao Fukushima
Venue: Journal of Global Optimization (2007)

This paper considers the problem of finding as many as possible, hopefully all, solutions of the general (i.e., not necessarily monotone) variational inequality problem (VIP). Based on global optimization reformulation of VIP, we propose a hybrid evolutionary algorithm that incorporates local search in promising regions. In order to prevent searching process from returning to the already detected global or local solutions, we employ the tunneling and hump-tunneling function techniques. The proposed algorithm is tested on a set of test problems in the MCPLIB library and numerical results indicate that it works well in practice.
Fuzzy modeling via sector nonlinearity concept
Authors: Hiroshi Ohtake, Kazuo Tanaka, Hua O. Wang
Venue: Integrated Computer-Aided Engineering (2003)

This paper presents a new fuzzy modeling technique via the so-called sector nonlinearity concept. To fully take advantage of the sector nonlinearity concept, we propose a new type of Takagi-Sugeno fuzzy model and develop an algorithm to identify model parameters. The algorithm consists of two steps. The purpose of the first step is to determine sector coefficients from input-output data. The second part identifies membership functions from the determined sector coefficients and the input-output data. Identification examples illustrate the utility of this approach.
High-Precision Current-Based CMOS WTA/LTA Filters
Authors: Luis Abraham Sanchez-Gaspariano, Alejandro Diaz-Sanchez, Griselda Saldana-Gonzalez
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

The design, simulation and implementation of highprecision current-based CMOS WTA/LTA filters are reported. The circuits are fast, compact and exhibit a high resolution and a low-power consumption. Therefore, they result attractive to be used in massive parallel processing structures, i.e. neural networks. HSPICE simulation results are presented in AMIS 0.5mm technology. In addition, experimental results are reported with monolithic NMOS and PMOS transistors.
Bias of feedback cancellation algorithms based on direct closed loop identification
Authors: J. Hellgren
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

An adaptive filter can be used to cancel the undesired acoustic feedback of hearing aids. The adaptive algorithm studied in this paper uses the output and input signal of the hearing aid to continuously track the acoustic feedback path. The bias of the optimal estimate with a quadratic norm is analyzed. The results show the importance of having a good model of the input signal to the hearing aid, as the error in this model will introduce bias in the estimate of the feedback path.
Putting declarative programming into the web: translating curry to javascript
Authors: Michael Hanus
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipulate complex data in a type-safe way, i.e., it is ensured that only typecorrect data is accepted by the interface, where types can be specified by standard types of a programming language as well as any computable predicate on the data. The interfaces are web based, i.e., the data can be manipulated with standard web browsers without any specific requirements on the client side. However, if the client's browser has JavaScript enabled, one could also check the correctness of the data on the client side providing immediate feedback to the user. In order to release the application programmer from the tedious details to interact with JavaScript, we propose an approach where the programmer must only provide a declarative description of the requirements of the user interface from which the necessary JavaScript programs and HTML forms are automatically generated. This approach leads to a very concise and maintainable implementation of web-based user interfaces. We demonstrate an implementation of this concept in the declarative multi-paradigm language Curry where the integrated functional and logic features are exploited to enable the high level of abstraction proposed in this paper.
Public Key distribution with secure DNS
Authors: James M. Galvin
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

Recently, many protocols in the Internet are proposing the use of public key cryptography in support of integrity and authentication security services. However, each of these protocols lacks a globally available public key distribution and management system. A secure version of the Domain Name System (DNS) is being developed which, conveniently, provides an infrastructure ideally suited for the distribution and management of public keys. We propose how this infrastructure of the secure DNS could be exploited by today's users of the Internet to distribute and manage their personal public keys.
Content Cruising System under Dense Region of Mobile Nodes
Authors: Takaaki Ishida, Masayoshi Imaike
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

We are developing "Content Cruising System (CCS)" which is a decentralized and autonomous distribution system for location-based content. CCS is constructed by each mobile nodes working cooperatively. The content which is made in CCS is carried to its destination and remains there by multihop wireless ad-hoc communications among mobile nodes. Considering scalability, "numbers of nodes" and "numbers of content" must be considered because these two uncertain factors cause heavy traffic on wireless network. In this paper, we present our approach to avoid these problems under dense region of mobile nodes.
Using full reference history for efficient document replacement in web caches
Authors: Hyokyung Bahn, Sam H. Noh, Sang Lyul Min, Kern Koh
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

With the increase in popularity of the World Wide Web, the research community has recently seen a proliferation of Web caching algorithms. This paper presents a new such algorithm, that is efficient and robust, called Least Unified-Value (LUV). LUV evaluates a Web document based on its cost normalized by the likelihood of it being re-referenced. This results in a normalized assessment of the contribution to the value of a document, leading to a fair replacement policy. LUV can conform to arbitrary cost functions of Web documents, so it can optimize any particular performance measure of interest, such as the hit rate, the byte hit rate, or the delay-savings ratio. Unlike most existing algorithms, LUV exploits complete reference history of documents, in terms of reference frequency and recency, to estimate the likelihood of being re-referenced. Nevertheless, LUV allows for an efficient implementation in both space and time complexities. The space needed to maintain the reference history of a document is only a few bytes and furthermore, the time complexity of the algorithm is O(log2n), where n is the number of documents in the cache. Trace-driven simulations show that the LUV algorithm outperforms existing algorithms for various performance measures for a wide range of cache configurations.
Sub-pixel registration in computational imaging and applications to enhancement of maxillofacial ct data
Authors: Hassan Foroosh
Venue:  (2006)

In computational imaging, data acquired by sampling the same scene or object at different times or from different orientations result in images in different coordinate systems. Registration is a crucial step in order to be able to compare, integrate and fuse the data obtained from different measurements. Tomography is the method of imaging a single plane or slice of an object. A Computed Tomography (CT) scan, also known as a CAT scan (Computed Axial Tomography scan), is a Helical Tomography, which traditionally produces a 2D image of the structures in a thin section of the body. It uses X-ray, which is ionizing radiation. Although the actual dose is typically low, repeated scans should be limited. In dentistry, implant dentistry in specific, there is a need for 3D visualization of internal anatomy. The internal visualization is mainly based on CT scanning technologies. The most important technological advancement which dramatically enhanced the clinician's ability to diagnose, treat, and plan dental implants has been the CT scan. Advanced 3D modeling and visualization techniques permit highly refined and accurate assessment of the CT scan data. However, in addition to imperfections of the instrument and the imaging process, it is not uncommon to encounter other unwanted artifacts in the form of bright regions, flares and erroneous pixels due to dental bridges, metal braces, etc. Currently, removing and cleaning up the data from acquisition backscattering imperfections and unwanted artifacts is performed manually, which is as good as the experience level of the technician. On the other hand the process is error prone, since the editing process needs to be performed image by image. We address some of these issues by proposing novel registration methods and using stonecast models of patient's dental imprint as reference ground truth data. Stone-cast models were originally used by dentists to make complete or partial dentures. The CT scan of such stone-cast models can be used to automatically guide the cleaning of patients' CT scans from defects or unwanted artifacts, and also as an automatic segmentation system for the outliers of the CT scan data without use of stone-cast models. Segmented data is subsequently used to clean the data from artifacts using a new proposed 3D inpainting approach.
Intensive Care Window: A Multi-Modal Monitoring Tool for Intensive Care Research and Practice
Authors: Harald Gjermundrod, Marios Papa, Demetrios Zeinalipour-Yazti, Marios D. Dikaiakos, George Panayi, Theodoros Kyprianou
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Intensive Care Units are widely considered as the most technologically advanced environments within a hospital. In such environments, physicians are confronted with multiple medical devices that monitor the inpatients. The capability to collect, store, process, and share inpatient monitoring data along with the remarks of the treating physicians can bring tremendous benefits to all aspects of Intensive Care Medicine (practice, research, education). The IC-Window makes it feasible for physicians to extract, view, store, and replay Clinically Interesting Episodes through simple, intuitive user interfaces.
Generic containers for a distributed object store
Authors: Carsten Weich
Venue: Proceedings of the USENIX Conference on Object-Oriented Technologies on USENIX Conference on Object-Oriented Technologies (COOTS) (1995)

In this paper we report of an experiment about how generic container classes can be used to build up a distributed main memory object store. This approach is inspired by the C++ standard template library (STL) but uses set-like associative structures instead of the array-like sequential structures mainly used by the STL. The basic structure is a container with only fundamental functionality. The only way to access the data of the elements is to apply a function to all the elements. We show how such containers can be extended to indexed sets and distributed object stores. We use Modula-3 to implement the generic classes. Experiments show that such containers form powerful building blocks especially suitable for implementing distributed containers.
Sparse Matrix Computations on Reconfigurable Hardware
Authors: Gerald R. Morris, Viktor K. Prasanna
Venue: Computer (2007)

Using a high-level-language to hardware-description-language compiler and some novel architectures and algorithms to map twowell-known double-precision floating-point sparse matrix iterative-linear-equation solvers--the Jacobi and conjugate gradient methods--onto a reconfigurable computer achieves more than a twofold speedup over software.
Beyond Stack Inspection: A Unified Access-Control and Information-Flow Security Model
Authors: Marco Pistoia, Anindya Banerjee, David A. Naumann
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

Modern component-based systems, such as Java and Microsoft .NET Common Language Runtime (CLR), have adopted Stack-Based Access Control (SBAC). Its purpose is to use stack inspection to verify that all the code responsible for a security-sensitive action is sufficiently authorized to perform that action. Previous literature has shown that the security model enforced by SBAC is flawed in that stack inspection may allow unauthorized code no longer on the stack to influence the execution of security-sensitive code. A different approach, History-Based Access Control (HBAC), is safe but may prevent authorized code from executing a security-sensitive operation if less trusted code was previously executed. In this paper, we formally introduce Information-Based Access Control (IBAC), a novel security model that verifies that all and only the code responsible for a security-sensitive operation is sufficiently authorized. Given an access-control policy á, we present a mechanism to extract from it an implicit integrity policy é, and we prove that IBAC enforces é. Furthermore, we discuss large-scale application code scenarios to which IBAC can be successfully applied.
Network-in-a-box: how to set up a secure wireless network in under a minute
Authors: Dirk Balfanz, Glenn Durfee, Rebecca E. Grinter, D. K. Smetters, Paul Stewart
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

Combining effective security and usability is often considered impossible. For example, deploying effective security for wireless networks is a difficult task, even for skilled systems administrators - a fact that is impeding the deployment of many mobile systems. In this paper we describe a system that lets typical users easily build a highly secure wireless network. Our main contribution is to show how gesture-based user interfaces can be applied to provide a complete solution for securing wireless networks. This allows users to intuitively manage the network security of their mobile devices, even those with limited user interfaces. We demonstrate through user studies that our secure implementation is considerably easier to use than typical commercially available options, even those that provide lower security. Our gesture-based approach is quite general, and can be used to design a wide variety of systems that are simultaneously secure and easy to administer.