ppxscal/embedding_network huggingface dataset:
Computer science education for majors of other disciplines
Authors: J. A. Archibald,  Jr.
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

There is an old saying that a specialist is a person who "knows more and more about less and less." It would be nice to believe that that saying, if ever true, is no longer true. Our world does not consist of little, isolated problems and situations which exist totally independent of their surroundings; it consists, rather, of a massive set of interconnected and interrelated objects and events. While, on the one hand, practical considerations make it necessary to isolate subsystems for the purposes of conducting detailed study, on the other hand a subsystem cannot be fully understood without understanding its interfaces with and relationships to its environment and the other systems with which it is associated. Indeed, we are witnessing the beginnings of this type of interdisciplinary activity with the present levels of interest and trends in biochemistry, biophysics, and biomathematics, as well as in some of the modern approaches to the study of the environment. Thus, we recognize that educational programs can no longer address themselves to single, isolated disciplines. Indeed, the approach to higher education needs to be interdisciplinary to a degree never before appreciated. The present need is not for a scientist with a monolithic perspective who has majored in a traditional discipline in a traditional manner, but rather a scientist with an interdisciplinary perspective who has studied in a broad, interdisciplinary program with an area of specialization. Computer Science must contribute, effectively, to broad, interdisciplinary programs for individuals specializing in a wide variety of fields. We must address ourselves to two primary considerations with equal vigor: the development of specialized understandings for the practice of Computer Science, and the development of generalized understandings to aid in the practice of other disciplines. We must present a degree program that includes sufficient study in the other disciplines to enable the new practitioner to participate effectively and innovatively with professionals from other disciplines in the solution of problems, and we must provide sufficient instruction to majors in other disciplines that they will be able to understand the relationships between the respective disciplines and the role and utilization of Computer Science in the solution of problems in their disciplines. In both cases, more emphasis needs to be placed upon interfaces. The need for such action has been mentioned many times in the past. The responsibility of providing appropriate programs for majors was commented upon in an earlier paper. The second responsibility, Computer Science for majors of other disciplines, is discussed herein.
A Parallel Self-adaptive Subspace Searching Algorithm for Solving Dynamic Function Optimization Problems
Authors: Yan Li, Zhuo Kang, Lishan Kang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

In this paper, a parallel self-adaptive subspace searching algorithm is proposed for solving dynamic function optimization problems. The new algorithm called DSSSEA uses a re-initialization strategy for gathering global information of the landscape as the change of fitness is detected, and a parallel subspace searching strategy for maintaining the diversity and speeding up the convergence in order to find the optimal solution before it changes. Experimental results show that DSSSEA can be used to track the moving optimal solutions of dynamic function optimization problems efficiently.
The MoCA Workbench: Support for Creativity in Movie Content Analysi
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Semantic access to the content of a video is highly desirable for multimedia content retrieval. Automatic extraction of semantics requires content analysis algorithms. Our MoCA (Movie Content Analysis) project provides an interactive workbench supporting the researcher in the development of new movie content analysis algorithms. The workbench offers data management facilities for large amounts of video/audio data and derived parameters. It also provides an easy-to-use interface for a free combination of basic operators into more sophisticated operators. We can combine results from video track and audio track analysis. The MoCA Workbench shields the researcher from technical details and provides advanced visualization capabilities, allowing attention to focus on the development of new algorithms. The paper presents the design and implementation of the MoCA Workbench and reports practical experience.
Deconstructing an old master painting using photoshop's advanced toolset
Authors: Martin Constable
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

An old master painting is a highly 'made' thing and every aspect of its appearance has been subject to careful consideration and evaluation before its manufacture. These aspects can be very hard to grasp but using Photoshop's advanced toolset they can be visualized and made easier for the student of art history to visualize. Interesting applications of the Adjustments menu, the blend modes and different color spaces will all be covered.
Requirements of federated trust management for service-oriented architectures
Authors: Zhengping Wu, Alfred C. Weaver
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

With the emergence of an effective infrastructure supporting Grid Computing and Web Services, service-oriented computing has been growing over the last few years, and service-oriented architectures are becoming an important computing paradigm. When different trust domains control different component services, trust management plays a critical role to smooth the collaboration among component services. The federation of these component services makes new demands for managing trust-related behavior. Although many extant trust management systems deal with intradomain trust behaviors, there is a growing need for effective strategies for managing inter-domain behaviors. In this paper we explore requirements for a federated trust management system. The purpose of this paper is not to suggest a single type of system covering all necessary features; instead, its purpose is to initiate a discussion of the requirements arising from inter-domain federation, to offer a context in which to evaluate current and future solutions, and to encourage the development of proper models and systems for federated trust management. Our discussion addresses issues arising from trust representation, trust exchange, trust establishment, trust enforcement, and trust storage.
Design of an Internet-Based Advisory System: A Multi-agent Approach
Authors: Saadat M. Alhashmi
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

With the emerging proliferation of information and communications technology in the home and work environments, the provision of computer-based medical advisory systems in healthcare could lead to huge savings to the cost of caring for patients with chronic conditions, such as, diabetes, asthma and hypertension. This paper proposes that an internet-based medical expert system could facilitate a far more efficient system in eliminating the number of unnecessary visits to General Practitioner (GP) for routine consultations. An internet-based intelligent system implementing a variety of functions carried in GP consultations is, thus proposed. The system design is based on multi-agent architecture, which attempts to replicate the roles of each person in a typical GP consultation environment. The role of clinical decision-making is carried out by a fuzzy inference engine linked to a knowledge-base of patient records. The management of diabetes is presented as a case study in the paper.
Measuring mobile service usage: methods and measurement points
Authors: Antero Kivi
Venue: International Journal of Mobile Communications (2009)

A comprehensive understanding of mobile service usage is increasingly difficult as a fragmented user base is accessing internet-based services using multiple wireless networks. In this paper, alternative data collection methods are reviewed. Surveys and end-user monitoring provide very detailed sample-based data, whereas wireless network data are less granular but cover an operator's entire subscriber base. Servers give detailed data on a focused user base. In future, survey-based methods will be increasingly complemented with automated measurements. Multifunctional mobile handsets and servers of internet-based service providers seem the most promising measurement points, whereas 2G/3G mobile networks are less useful as traffic leaks to alternative networks.
ITIL V3 Service Capability RCV - Release, Control and Validation of IT Services Best Practices Study and Implementation Guide
Authors: Tim Malone, Ivanka Menken, Gerard Blokdijk
Venue:  (2008)

To implement new services in a controlled and cost-effective manner IT departments must successfully implement Release, Control and Validation (RCV) best practices.This book covers practical guidance on the design and implementation of integrated end-to-end processes based on proven industry best practice guidelines.It provides in-depth knowledge of the ITIL RCV areas: Change Management, Release and Deployment Management, Service Validation and Testing, Service Asset and Configuration Management, Request Fulfillment, Service Evaluation and Knowledge Management. Release, Control and Validation Best Practices is designed to complement the certified ITIL V3 Capability Programs for IT Service Management. This book focuses on describing the industry best practices for the release, control and validation of services, including:- Change Management: The process that realizes successful service transition - Release and Deployment Management: The process that ensures the proper building, testing and deploying of a release - Service Validation and Testing: The process that ensures the integrity and the quality of service transition - Service Evaluation: The process that considers whether the performance and value of a service is acceptable - Request Fulfillment: The process that ensures the effective and expedient fulfillment of service requests and provides a standard for evaluation - Service Asset & Configuration Management: The process that monitors the state of service transition - Knowledge Management: The process that enhances the ongoing management decision support and service delivery capabilityThe information provided in this book is based on version 3 of the ITIL framework, predominantly focusing on the volume of Service Transition. Other guidance provided includes:- Suggested templates and criteria for implementing Release, Control and Validation (RCV) processes. - Explanation of the more abstract ITIL concepts to improve understanding. - Review questions to assist study for the ITIL Intermediate Capability RCV exam.
StegCure: an amalgamation of different steganographic methods in GIF image
Authors: L. Y. Por, W. K. Lai, Z. Alireza, B. Delina
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Steganography is one of the information hiding techniques which conceals a secret message into an unsuspicious medium so that a communication channel is undetectable. Suspicion becomes the significant key determinant in the field of steganography. The steganographic algorithms and functions which are applied in constructing of the stego medium can distinguish the difference between various steganography systems. This paper presents an overview of steganography on GIF image format in order to explore the potential of GIF in information hiding research. A platform, namely StegCure is proposed by using an amalgamation of three different Least Significant Bit (LSB) insertion algorithms that is able to perform steganographic method. In fact, the receiver is allowed to perform only once in desteganography to restrict any unauthorized user from retrieving the secret message through trial and error. Besides, we also highlight a few aspects in LSB methods on image steganography. The future work will be focused in assimilation of diversified methods into a whole gamut of steganography systems.
Engineering and Technical Drawing Using SolidEdge Version 19
Authors: Jerry Craig
Venue:  (2007)

Table of Contents 1. Introduction 2. 2D Drawing 3. Geometry 4. Normal Surface Modeling 5. Inclined Surface Modeling 6. Oblique Surface Modeling 7. Curved Surface Modeling 8. Thin Surface Modeling 9. Assembly Modeling and Drawings 10. Detail Production Drawings 11. Sheet Metal Modeling and Flat Patterns 12. Standard Parts Realistic Rendering Parametric Design Bent Tubing and Wire Routing 2D Views to 3D Model Finite Element Analysis PMI - Part Manufacturing Information Index 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
On the linear convergence of Newton-Krylov methods
Authors: Georgi V. Smirnov, Vera Sa
Venue: Optimization Methods Software (2009)

Solution of large-scale nonlinear optimization problems and systems of nonlinear equations continues to be a difficult problem. One of the main classes of algorithms for solving these problems is the class of Newton-Krylov methods. In this article the number of iterations of a Krylov subspace method needed to guarantee at least a linear convergence of the respective Newton-Krylov method is studied. The problem is especially complicated if the matrix of the linear system to be solved is nonsymmetric. In the article, explicit estimates for the number of iterations for the Krylov subspace methods are obtained.
At home and with computer access: why and where people use cell phones to access the internet
Authors: Stina Nylander, Terés Lundquist, Andreas Brännström
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We conducted a diary and interview study to investigate where and why people use cell phones to access the Internet. In more that 50% of the cases, our participants chose a phone even though they had access to a computer, and the most frequent location for cell phone Internet access was the home.
Classical Circuit Theory, 1st edition
Authors: Omar Wing
Venue:  (2008)

This book begins with the basic principles of circuits, derives their analytic properties in both the time and frequency domains, and states and proves the two important theorems. It then develops an algorithmic method to design common and uncommon types of circuits, such as prototype filters, lumped delay lines, constant phase difference circuits, and delay equalizers. The material also discusses the relation between gain and phase, linear and minimum phase functions, group delay, sensitivity functions, scattering matrix, synthesis of transfer functions, approximation of filter functions, all-pass circuits, and circuit design by optimization. This book fills a need for a modern text on the mathematical foundations of passive circuits in general and passive filter design in particular. The mathematical foundations are what classical circuit theory, which is the subject of this book, is all about. It is old, but it has survived the test of time and it is still relevant today because it is basic.
Energy efficient filtering method in sensor networks
Authors: Soo Young Moon, Tae Ho Cho
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Wireless sensor networks (WSN) sense and report interesting events in the sensor field to users. Usually, the sensor field for WSN is hostile and lacks infrastructure, so WSNs are exposed to security threats. In false report injection attacks, attackers inject false reports into the network through compromised nodes. Among many countermeasures to the attacks, the statistical en-route filtering scheme (SEF) detects and drops false reports by collaborative generation and verification of event reports by sensor nodes. In SEF, each node verifies received reports based on a pre-determined probability without consideration of sending nodes, consuming unnecessary energy for report verification. In this paper, we propose an energy-efficient filtering method for sensor networks. In the method, each node controls its verification probabilities for event reports, which depend on sending nodes. The number of recent valid reports and the false traffic ratio of each neighbor node are used to determine the verification probability for each node. We confirmed that our method uses energy efficiently without weakening en-route filtering capability.
Interactive Learning of Expert Criteria for Rescue Simulations
Authors: Thanh-Quang Chu, Alain Boucher, Alexis Drogoul, Duc-An Vo, Hong-Phuong Nguyen, Jean-Daniel Zucker
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

The goal of our work is to build a DSS (Decision Support System) to support resource allocation and planning for natural disaster emergencies in urban areas such as Hanoi in Vietnam. The first step has been to conceive a multi-agent environment that supports simulation of disasters, taking into account geospatial, temporal and rescue organizational information. The problem we address is the acquisition of situated expert knowledge that is used to organize rescue missions. We propose an approach based on participatory techniques, interactive learning and machine learning. This paper presents an algorithm that incrementally builds a model of the expert knowledge by online analysis of its interaction with the simulator's proposed scenario.
Bubble domain memory systems
Authors: John E. Ypma
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

This paper presents bubble memory technology from a systems viewpoint. A perspective is given listing the characteristics of bubble domain memory relative to other available and oncoming memory technology. The application areas most conformed to bubble capability are identified. Bubble domain chip topologies and bubble memory systems organized to fit the application are discussed. Examples of actual devices being built are presented. Prototype systems are discussed, indicating their organization and interface command and timing structure.
Time-Constrained Keyframe Selection Technique
Authors: Andreas Girgensohn, John Boreczky
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In accessing large collections of digitized videos, it is often difficult to find both the appropriate video file and the portion of the video that is of interest. This paper describes a novel technique for determining keyframes that are different from each other and provide a good representation of the whole video. We use keyframes to distinguish videos from each other, to summarize videos, and to provide access points into them. The technique can determine any number of keyframes by clustering the frames in a video and by selecting a representative frame from each cluster. Temporal constraints are used to filter out some clusters and to determine the representative frame for a cluster. Desirable visual features can be emphasized in the set of keyframes. An application for browsing a collection of videos makes use of the keyframes to support skimming and to provide visual summaries.
On the Stopping Distance and Stopping Redundancy of Product Codes
Authors: Morteza Hivadi, Morteza Esmaeili
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Stopping distance and stopping redundancy of product binary linear block codes is studied. The relationship between stopping sets in a few parity-check matrices of a given product code C and those in the parity-check matrices for the component codes is determined. It is shown that the stopping distance of a particular parity-check matrix of C, denoted HP, is equal to the product of the stopping distances of the associated constituent parity-check matrices. Upper bounds on the stopping redundancy of C is derived. For each minimum distance d = 2r, r ≥ 1, a sequence of [n,k,d] optimal stopping redundancy binary codes is given such k/n tends to 1 as n tends to infinity.
Bandwidth impacts of localizing peer-to-peer IP video traffic in access and aggregation networks
Authors: Kenneth Kerpez
Venue: EURASIP Journal on Wireless Communications and Networking (2008)

This paper examines the burgeoning impact of peer-to-peer (P2P) traffic IP video traffic. High-quality IPTV or Internet TV has high-bandwidth requirements, and P2P IP video could severely strain broadband networks. A model for the popularity of video titles is given, showing that some titles are very popular and will often be available locally;making localized P2P attractive for video titles. The bandwidth impacts of localizing P2P video to try and keep traffic within a broadband access network area or within a broadband access aggregation network area are examined. Results indicate that such highly localized P2P video can greatly lower core bandwidth usage.
Atomic layer thermopile materials: physics and application
Authors: P. X. Zhang, H.-U. Habermeier
Venue: Journal of Nanomaterials (2008)

New types of thermoelectric materials characterized by highly anisotropic Fermi surfaces and thus anisotropic Seebeck coefficients are reviewed. Early studies revealed that there is an induced voltage in high TC oxide superconductors when the surface of the films is exposed to short light pulses. Subsequent investigations proved that the effect is due to anisotropic components of the Seebeck tensor, and the type of materials is referred to atomic layer thermopile (ALT). Our recent studies indicate that multilayer thin films at the nanoscale demonstrate enhanced ALT properties. This is in agreement with the prediction in seeking the larger figure of merit (ZT) thermoelectric materials in nanostructures. The study of ALT materials provides both deep insight of anisotropic transport property of these materials and at the same time potential materials for applications, such as light detector and microcooler. By measuring the ALT properties under various perturbations, it is found that the information on anisotropic transport properties can be provided. The information sometimes is not easily obtained by other tools due to the nanoscale phase coexistence in these materials. Also, some remained open questions and future development in this research direction have been well discussed.
Price movements in the Japanese online home electronics market
Authors: Tomonari Akimoto, Fumiko Takeda
Venue: Electronic Commerce Research and Applications (2009)

This article investigates the price movements of home electronics products listed on a Japanese price comparison site. Our findings are as follows. (1) Price dispersion increases at earlier stages of the product life cycle and decreases at later stages. (2) The size of the price changes is larger in earlier stages than in the later stages. (3) The lowest prices change very frequently. (4) The lowest price decreases outnumber the lowest price increases. (5) The size of the lowest price changes is very small and is smaller when decreases occur than when increases occur.