ppxscal/embedding_network huggingface dataset:
Prediction of the two-scale buckling response of sandwich beams under in-plane compression
Authors: L. Léotoing, S. Drapier, A. Vautrin
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper is dedicated to the study of global (at the sandwich scale) and local (at the component scale) buckling in sandwich structures. First, a unified analytical characterization is given for both global and local buckling. Then these analytical critical loads are translated into sandwich configuration selection diagrams. A 'light' FE model is then proposed to carry out low CPU-time non-linear post-buckling analyses. The post-buckling response computed for elastic materials are mostly super-critical, for small geometrical imperfections. But for some configurations, interactive buckling can develop yielding a highly sub-critical response due to the occurrence of some unsymmetrically distributed geometrical localizations. When an elastoplastic core is considered the response becomes systematically sub-critical, and limit loads reduce consequently. A strong imperfection sensitivity is also noticed.
Why isn't ICT as effective as it ought to be in school education?
Authors: Andrew E. Fluck
Venue: Proceedings of the 3.1 and 3.3 working groups conference on International federation for information processing: ICT and the teacher of the future - Volume 23 (2003)

Meta-studies of the effectiveness of ICT (information and communication technology) in education indicate that it has about as much impact as any other innovation (Parr 2000). However, there are great expectations about ICT having as significant an influence in this area as it has had in industry and commerce (Kraver 1997). Where have we gone wrong? Are teachers bound to the past and determined to dismiss any technological innovation until it has truly proven itself reliable? Or are systems rushing into the adoption of computers in schools belatedly for a mixture of social, economic and purportedly pedagogic reasons? I say belatedly, because it is increasingly the case that in several countries students have far easier access to a computer and the Internet at home than in the classroom.This paper describes some of the significant issues threatening greater adoption of ICT, including industrial fears, teacher professionalism supported by school effectiveness research, examination systems, current curricula, and equity policies. It indicates how some of these threats are being met by reference to short case studies and a discussion about evidence of systemic transformation.
On the use of VHDL as a multi-valued logic simulator
Authors: C. Rozon
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

This work demonstrates how VHDL can be used as a potential tool for the simulation of multi-valued digital circuits and systems. Although not all features of a given VHDL simulator can be applied to MVL signals, some can easily be adapted to provide enough information to verify functionality and/or timing specifications. The VHDL modelling and simulation of two simple ternary circuits are described and commented.
Secrets of the iPod
Authors: Christopher Breen
Venue:  (2002)

:It's no mystery why the iPod is a marvel: Apple's lightweight portable music player lets you store and organize as many as 2,000 songs on its hard drive. Secrets of the iPod helps you get the most from your iPod -- and unlock its hidden potential. Macworld magazine columnist Chris Breen shows you how to use your iPod, from storing and playing songs to connecting the handheld to your car's cassettle player.
Discovery of Complex Events Occurring in Payment System
Authors: V. E. Podobedov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The problem of discovering the complex events in the payment system, and representing the knowledge about them are considered. The hierarchy of events occurring in the system is proposed. The approaches to constructing the characteristics of the system and its subjects on the basis of the species and rank distibutions are offered. Strong change of such characteristics is treated as a signal for probable occurrence of a complex event related to the corresponding subject or the whole system. 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
Tracking with Omni-Directional Vision for Outdoor AR Systems
Authors: Jong Weon Lee, Suya You, Ulrich Neumann
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Most pose (3D position and 3D orientation) tracking methods using vision require a priori knowledge about the environment and correspondences between 3D environment features and 2D images. This environmental information is difficult to acquire accurately for large working volumes or may not be available at all, especially for outdoor environments. As a result, most pose tracking methods using vision are designed for small indoor working spaces. We track the pose of a moving camera from 2D images of the world. The pose of a camera istracked through two 5 degree-of-freedom (DOF) motion estimations, which requires only 2D-to-2D correspondences. Therefore, the presented method can be applied to varied working space sizes including outdoor environments.
A framework for statistical multiplexing onto a variable-bit rate output channel
Authors: Chan-Weng Lai, S. C. Liew
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

This paper investigates soft multiplexing, an issue that arises in VP-based ATM networks. The main distinguishing feature of this form of multiplexing (as opposed to traditional statistical multiplexing) is that the output channel is a variable-bit rate VP. The concepts of work conservation and greediness were introduced to study soft multiplexing systematically. We assume that the overall multiplexed output traffic is regulated and policed by a leaky bucket. Before being allowed to access the output channel, each input traffic stream is also controlled by a leaky bucket. It is shown that although strict performance guarantee can be provided to each input traffic stream by independent leaky bucket operation, output-channel utilization can be rather low, and it can be improved significantly if we allow some interactions among the leaky buckets of the input streams. In particular, we show that two simple soft-multiplexing schemes, excess token passing and token borrowing, can achieve higher output-channel utilization, better delay and loss performance without sacrificing guarantee to each session.
Short-term scheduling in multiprogramming systems
Authors: Per Brinch Hansen
Venue: ACM SIGOPS Operating Systems Review (1972)

This paper defines a set of scheduling primitives which have evolved from multiprogramming systems described by Dijkstra, Lampson, Saltzer, and the present author. Compared to earlier papers on the same subject, the present one illustrates a more concise description of operating system principles by means of algorithms. This is achieved by (1) describing the primitives as the instructions of an abstract machine which in turn is defined by its instruction execution algorithm; (2) introducing a notation which distinguishes between the use of synchronizing variables (semaphores) to achieve mutual exclusion of critical sections, and to exchange signals between processes which have explicit input/output relationships; (3) considering the influence of critical sections on preemption and resumption; and (4) using a programming language, Pascal, which includes natural data types (records, classes, and pointers) for the representation of process descriptions and scheduling queues. The algorithms are written at a level of detail which clarifies the fundamental problems of process scheduling and suggests efficient methods of implementation.
Multimedia task reliability analysis based on token ring network
Authors: D. J. Chen, M. S. Chang, C. I. Yang, Kuo-Lung Ku
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In this paper, we attempt to develop reliability models for the reliability analyses in distributed multimedia system. We propose two polynomial-time algorithms to compute the multimedia task reliability (MTR) and time-constraint multimedia task reliability (TCMTR) for distributed multimedia system based on token ring networks. Two main algorithms, multimedia task reliability for ring (MTRR) and multimedia task reliability for path (MTRP), are used to compute the MTR. For time constraint media access, we extend our proposed algorithms to compute TCMTR.
Nonlinear oscillators in Radio Frequency circuits
Authors: Benedetta Ferrario
Venue:  (1999)

A wide research has been carried on for radio frequency circuits with nonlinear conductance of quadratic type, the so called Van der Pol oscillators. New technology presents a more general nonlinearity. The aim of this paper is to analyse the main properties of a class of nonlinear oscillators arising in an integrated VCO circuit considered in radio frequency transceivers. The analysis will take in account thermal noise source. This gives an output voltage which is not a sinusoid; in fact the output spectrum is a band. Since high quality mobile communication requires narrow band spectrum, we will show how the parameters of the circuit can be changed in order to reduces the phase noise effects. 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
Unsupervised Learning of Human Motion
Authors: Yang Song, Luis Goncalves, Pietro Perona
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

An unsupervised learning algorithm that can obtain a probabilistic model of an object composed of a collection of parts (a moving human body in our examples) automatically from unlabeled training data is presented. The training data include both useful ¿foreground¿ features as well as features that arise from irrelevant background clutter¿the correspondence between parts and detected features is unknown. The joint probability density function of the parts is represented by a mixture of decomposable triangulated graphs which allow for fast detection. To learn the model structure as well as model parameters, an EM-like algorithm is developed where the labeling of the data (part assignments) is treated as hidden variables. The unsupervised learning technique is not limited to decomposable triangulated graphs. The efficiency and effectiveness of our algorithm is demonstrated by applying it to generate models of human motion automatically from unlabeled image sequences, and testing the learned models on a variety of sequences.
Interclass Testing of Object Oriented Software
Authors: Vincenzo Martena, Alessandro Orso, Mauro Pezzé
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

The characteristics of object-oriented software affecttype and relevance of faults. In particular, the state of theobjects may cause faults that cannot be easily revealed withtraditional testing techniques. This paper proposes a newtechnique for interclass testing, that is, the problem of derivingtest cases for suitably exercising interactions amongclusters of classes. The proposed technique uses data-flowanalysis for deriving a suitable set of test case specificationsfor interclass testing. The paper then shows how toautomatically generate feasible test cases that satisfy thederived specifications using symbolic execution and automateddeduction. Finally, the paper demonstrates the effectivenessof the proposed technique by deriving test cases fora microscope controller developed for the European SpaceLaboratory of the Columbus Orbital Facility.
On Optimal Pipeline Processing in Parallel Query Execution
Authors: Stefan Manegold, Florian Waas, Martin L. Kersten
Venue:  (1998)

A key assumption underlying query optimization schemes for parallel processing is that their cost models can deal with the multitude of effects encountered during the execution phase. Unfortunately, this is rarely the case and the optimal processing is only achieved in a few situations.
Dynamic information retrieval optimization using mobile agents
Authors: Subrata Das, Kurt Shuster, Curt Wu
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Mobile agents have the potential to substantially improve the speed and efficiency with which distributed and heterogeneous data is retrieved. By moving the computation to the data, retrieval times can be reduced by the elimination of unnecessary data transfer. One way to improve a mobile agent system's retrieval efficiency is to incorporate various query optimization techniques (Das et. al., 2002). These methods involve re-writing of the query execution graph so each mobile agent retrieves its requested data in an optimized order, thus minimizing total data transfer size. While these query re-writing methods can be highly effective in reducing both retrieval times and data transfer sizes, they are generally "static", in that the mobile agents retrieve data in a particular order based on an itinerary that is fixed at the time the plan is generated. We have developed a system by which the advantages of mobile agents are leveraged to optimize data retrieval by dynamically optimizing the retrieval strategy as it is carried out. This strategy equips each spawned agent with the full query execution graph and necessary code to execute the retrieval plan at any data site in the network. The spawned agents communicate and collaborate with each other to dynamically decide where to migrate, send data, and perform necessary computations. These decisions depend on retrieval factors such as network speed, data size, and the computational capabilities of the data servers involved in the retrieval. The feasibility of the approach has been demonstrated within a local area network environment using Earth Science data and we present some experimental results in this context.
HTML Black Book
Authors: Steven Holzner
Venue:  (2002)

:Covers HTML 4.0 programming thoroughlyfrom the essentials to issues of security, from XML to CGI programming. An immediate and comprehensive answer source, rather than a diffuse tutorial, for serious programmers who want to see difficult material covered in depth without the fluff. Discusses XML, dynamic HTML, JavaScript, Java, and Perl CGI programming to create a full Web site programming package. Written by the author of several successful titles published by The Coriolis Group.
Merger Control in the New Economy
Authors: Lars-Hendrik Röller, Christian Wey
Venue: Netnomics (2003)

This paper addresses the potential for conflict between antitrust authorities in the arena of merger control in the new economy. By &ldquo;new economy&rdquo; we mean two related developments. First, the internationalization of the economy, i.e. the ability to sell and produce products world-wide, and secondly, markets with certain characteristics such as network effects and other aspects of natural monopoly. We focus on three types of substantive issues in merger control &ndash; market definition, assessment of competitive effects, and the role of remedies. We argue that the scope for conflict varies significantly across these three arenas. In particular, conflict over market definition is less likely. By contrast, the assessment of competitive effects and the role of remedies are areas where conflict between antitrust authorities may be more likely in &ldquo;new economy-type&rdquo; markets.
Dynamic Refinement of Classification Rules
Authors: Kalyani K. Manchi, Xindong Wu
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Given a set of training examples in the form of (input, output) pairs, induction generates a set of rules that when applied to an input example, can come up with a target output or class for that example. At deduction time, these rules can be applied to a pre-classified test set to evaluate their accuracy. With existing rule induction systems, the rules are "frozen" on the training set, and they cannot adapt to a changing distribution of examples. In this paper, we propose two approaches to dynamically refine the rules at deduction time, to overcome this limitation. For each test example, we perform a classification using existing rules. Depending on whether the classification is correct or not, the rule which was responsible for the classification is refined. When the correct classification is found, we refine the associated rule in one of two ways: by increasing the coverages of all conjunctions associated with the rule, or by increasing the coverage of the rule's most important conjunction only for the test example in question. These refined rules are then used for deducing the classifications for remaining examples. Of the two deduction methods, the second method has been shown to significantly improve the accuracy of the rules when compared to the regular, non-dynamic deduction process.
Hardware timing verification using KRONOS
Authors: O. Maler, S. Yovine
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

In this paper we describe the KRONOS system, a tool for verifying real-time properties based on the model of timed-automata. As an example, we show how KRONOS is applied to the verification of a MOS circuit under various delay assumptions.
The relationship between systems development methodologies and organisational demographics: a survey of New Zealand organisations
Authors: J. L. Pastor Urban, R. J. Whiddett
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Summary form only given, as follows. One of the most important challenges faced by systems developers is the selection of the systems development methodology. The methodology chosen will have a large impact on different aspects of development (i.e, cost, time, resources needed, etc.). There is limited research aimed to assist systems developers in the selection of the most appropriate methodology for their particular cases. Previous research have mainly focused on the type of system and personal preferences, but very little has been said about the influence of organisational variables. The paper reports the results of a survey which studied the systems development methodologies used in different sectors of the New Zealand economy. The relationships between system development methodologies and organisational demographic variables are identified. Responses from 353 organisations show that there is a clear relationship between the two sets of variables.
Quality-driven software re-engineering
Authors: Ladan Tahvildari, Kostas Kontogiannis, John Mylopoulos
Venue: Journal of Systems and Software (2003)

Software re-engineering consists of a set of activities intended to restructure a legacy system to a new target system that conforms with hard and soft quality constraints (or non-functional requirements, NFR). This paper presents a framework that allows specific NFR such as performance and maintainability to guide the re-engineering process. Such requirements for the migrant system are modeled using soft-goal interdependency graphs and are associated with specific software transformations. Finally, an evaluation procedure at each transformation step determines whether specific qualities for the new migrant system can be achieved.
Deploying SRE in Your Organization or Company
Authors: A. A. Dolinsky, D. Rentschler, S. Steele, J. A. Teresinski, J. Widmaier
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

The introduction of some new practices into software organizations can be trying, arduous tasks. Software Reliability is a practice that fits in this category. A well thought out strategy needs to be used to successjidly and rapidly install Software Reliability Engineering (SRE) in a software organization. The successfid practitioner must be prepared to sell SRE, retain consultants, train project personnel, demonstrate it's effectiveness, provide measurements of the results, and advertise them. This panel, composed of four members with practical industry experience, will examine all of these areas as it explores the question: "What are the steps for bringing SRE into my organization or company?"
Robust Protocols for Proving Ownership of Images
Authors: Mahalingam Ramkumar, Ali N. Akansu
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

We explore the problem of proving ownership or origin of multimedia content like image/video or audio signals through watermarking. The need for watermarking arises out of the unsuitability of present copyright laws for claiming ownership of digital content. Watermarking schemes however, are threatened by counterfeit attacks, which primarily use the freedom available in the choice of signature or choice of the watermarking method. A restrictive protocol for watermarking could go a long way in rendering counterfeit attacks extremely difficult. We suggest a comprehensive protocol that makes it possible for the true owner to claim ownership unambiguously, while making it extremely difficult for a pirate to do so.
Intelligent Scheduling based on Start Time Adjustment for Advanced Sequential Control Systems
Authors: Takeiki Aizono, Tohru Kikuno
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

High productivity is required for industrial systems that are to produce large amounts of low-price products. Most industrial systems are sequentially controlled because materials and parts are processed and constructed step by step. A new method of sequential control is needed to increase productivity, and a new technique to schedule the start time of each process is also needed because of frequent adjustment of production lines and their equipment.Intelligent devices such as intelligent sensors and actuators used in the latest industrial systems have embedded high-performance processors and contain software modules. These devices cooperate and control processing robots and production lines. Advanced sequential control is proposed for sequential control systems consisting of distributed software modules.Processing time can be minimized and productivity increased by intelligent scheduling for advanced sequential control, and this paper describes a new method for adjusting the starting times of production processes automatically. This method shortens the time margin and decreases the total processing time. This paper also describes a Processing Flow Diagram that makes it easy to adjust the starting time of each process. The effectiveness of this intelligent scheduling and start-time-adjustment has been demonstrated by using them to optimize the operation of a system for testing disk plates.