ppxscal/embedding_network huggingface dataset:
Automobile Anti-theft System Design Based on GSM
Authors: Wan Lili, Chen Tiejun
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

An automobile remote alarm system based on GSM communication network is introduced. The TC35 GSM module and Microcontroller is combined with the system, vibration sensor and speed sensor are used to achieve short message service (SMS) alarm and dual theft-proof of automobile. The shortcoming of traditional systems including low security and small alarming range is overcome, and the cost of this system is cut down, so it should have good application prospects.
Discrete schemes for Gaussian curvature and their convergence
Authors: Zhiqiang Xu, Guoliang Xu
Venue: Computers Mathematics with Applications (2009)

The popular angular defect schemes for Gaussian curvature only converge at the regular vertex with valence 6. In this paper, we present a new discrete scheme for Gaussian curvature, which converges at the regular vertex with valence greater than 4. We show that it is impossible to build a discrete scheme for Gaussian curvature which converges at the regular vertex with valence 4 by a counterexample. We also study the convergence property of other discrete schemes for Gaussian curvature and compare their asymptotic errors by numerical experiments.
A quality assurance program for software maintenance
Authors: John W. Center
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper presents the description of a quality assurance (QA) program applied to software maintenance projects. The QA program is a set of checks or inspections overlaid on the steps of the maintenance project. The relationship between the QA program and project management is shown. The paper includes a brief discussion of waivers and deviations to standards and control documents. The QA checks are delegated to three levels. The rationale, scope, and authority for each level are discussed. A list of sample criteria used for each QA check or inspection is given.
Geometrical Compensation Algorithm of Multiview Image for Arc Multi-camera Arrays
Authors: Yun-Suk Kang, Yo-Sung Ho
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we propose a geometrical compensation algorithm for multiview image captured by an arc multi-camera array. To capture multiview image or multiview video, we require more than two cameras arranged on a multi-camera array. This multi-camera array, however, has geometrical errors since it is manually built. These errors are related to the mismatch in the vertical and horizontal directions among images and irregular camera rotations. Also, these errors become serious obstructions to implement many three-dimensional (3-D) or multiview image processing and applications such as depth map estimation and intermediate view generation. Therefore, it is required to compensate geometrical errors in multiview image. Our proposed algorithm simultaneously adjusts positions, orientations, and internal characteristics of cameras arranged on an arc multi-camera array. Experimental results show that this algorithm reduced the vertical mismatch in pixels among images. In addition, there were equal horizontal disparities and equal angles between two cameras, respectively.
Predicting Running Time of Grid Tasks based on CPU Load Predictions
Authors: Yuanyuan Zhang, Wei Sun, Yasushi Inoguchi
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

The ability to accurately predict task running time is of great importance for interactive applications and scheduling algorithms which need to determine how to use time-shared resources in a dynamic grid environment. In this paper we present and evaluate a new method to predict the running time of tasks in a grid. The prediction of task running time is based on a novel CPU load prediction method and is calculated from predictions of CPU load. We conducted evaluations using more than 10,000 randomized testcases run on load traces sampled from 39 heterogeneous machines. Our experimental results demonstrate that both our CPU load prediction method and task running time prediction strategy outperform significantly the widely used AR(16) load prediction model and the task running-time prediction method based on this model.
Proceedings of the 5th Australasian Conference on Interactive Entertainment
Venue: Australasian Conference on Interactive Entertainment ; Vol. 391 (2008)

The Fifth Australasian Conference on Interactive Entertainment (IE2008) is the latest in a series of annual regional meetings at which advances in interactive entertainment and computer games are reported. IE2008 was hosted by the Faculty of Information Technology --- Queensland University of Technology, and was held at the Gardens Point Campus in Brisbane 3rd to 5th of December, 2008. The Australasian Conference on Interactive Entertainment, in its fifth year, is a cross-disciplinary conference that brings together researchers from artificial intelligence, audio, cognitive science, cultural studies, drama, HCI, interactive media, media studies, psychology, computer graphics, as well as researchers from other disciplines working on new interactive entertainment specific technologies or providing critical analysis of games and interactive environments. This year's theme is "Resonating Experiences". Much attention is given to the relationships between media and audiences, games and players, cities and dwellers, writers and readers. This conference is concerned with how more resonating relationships are created, evaluated and sustained. What is resonance and who benefits? How do we design for it and how is it experienced by all of the intended and consequential participants? The invited speakers for IE2008 include Caryl Shaw, John Passfield and Kenneth D. Forbes. The Conference also includes an exhibition of Interactive Entertainment research projects, as well as guests presentation from Jose De Silva from the Queensland Gallery of Modern Art, and Richardo Peach from Australia Council for the Arts. IE2008 was held in cooperation with ACM SIGART, SIGCHI, SIGGRAPH and SIGWEB and the papers will be available from the ACM Digital Library.
Rails Pocket Reference, 1st edition
Authors: Eric Berry
Venue: Pocket Reference (2008)

Rails 2.1 brings a new level of stability and power to this acclaimed web development framework, but keeping track of its numerous moving parts is still a chore. Rails Pocket Reference offers you a painless alternative to hunting for resources online, with brief yet thorough explanations of the most frequently used methods and structures supported by Rails 2.1, along with key concepts you need to work through the framework's most tangled corners. Organized to help you quickly find what you need, this book will not only get you up to speed on how Rails works, it also provides a handy reference you can use anywhere, anytime. Inside, you'll find essential information on how to: Install Rails with RubyGems Build, compile, and process files with Rake Test Rails applications using assertions and fixtures Use Rails with Ajax Connect objects to a database using ActiveRecord Make web requests with the Action Controller framework Use REST web service APIs And much more. Save yourself hours of frustration: If you use Rails daily and just want the facts -- fast -- this is your book.
Fast extraction of high-quality framework-specific models from application code
Authors: Michał Antkiewicz, Thiago Tonelli Bartolomei, Krzysztof Czarnecki
Venue: Automated Software Engineering (2009)

Framework-specific models represent the design of application code from the framework viewpoint by showing how framework-provided concepts are instantiated in the code. Retrieving such models quickly and precisely is necessary for practical model-supported software engineering, in which developers use design models for development tasks such as code understanding, verifying framework usage rules, and round-trip engineering. Also, comparing models extracted at different times of the software lifecycle supports software evolution tasks.We describe an experimental study of the static analyses necessary to automatically retrieve framework-specific models from application code. We reverse engineer a number of applications based on three open-source frameworks and evaluate the quality of the retrieved models. The models are expressed using framework-specific modeling languages (FSMLs), each designed for an open-source framework. For reverse engineering, we use prototype implementations of the three FSMLs.Our results show that for the considered frameworks and a large body of application code rather simple code analyses are sufficient for automatically retrieving framework-specific models with high precision and recall. Based on the initial results, we refine the static analyses and repeat the study on a larger set of applications to provide more evidence and confirm the results. The refined static analyses provide precision and recall of close to 100% for the analyzed applications.
Supporting adaptable applications in grid resource management systems
Authors: Jeremy Buisson, Francoise Andre, Jean-Louis Pazat
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Grid computing promises to bring the resources to satisfy the increasing requirements of scientific applications. As grids result from several organizations that pool their computational resources, resource availability varies frequently inside grids. Relying on autonomous dynamic adaptability and managing dynamic collections of resources, technologies have been proposed in order to handle those variations at the level of applications. However, despite applications have evolved in order to fit better dynamic grid environments, grid resource managers still restrict to rigid jobs, thus inhibiting application adaptability and malleability. This paper discusses 3 options to overcome that restriction. Malleable job management can be built on top of existing unmodified infrastructures. It can also be implemented as a modification of the infrastructure. At last, we propose an intermediate approach that fosters the cooperation between the infrastructure and its users. Requiring an initial modification of the infrastructure, the latter design combines cost efficiency with possibility to further extend the job model without any additional modification of the infrastructure. In the discussion, qualitative arguments are supported by some experimental results.
Time-Frequency Decomposition for Analysis and Retrieval of 1-D Signals
Authors: Maria Grazia Albanesi, Marco Ferretti, Alessandro Giancane
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In the paper the time - frequency decomposition of Wavelets is use to characterize 1-D signals: the goal is to associate to each discrete signal a set of descriptors for fast retrieval in large database and/or recognition in noisy environment. Experiments are shown for an heterogeneous set of one dimensional signals, both synthetic and natural (audio signals). The efficacy of the method is tested against corruption by (white and colored) noise and/or attenuation, in order to simulate the transmission on noisy channels and LANs. Also the extension of the aglorithm to 2D signals shows satisfactory results and it has been applied in a content based retrieval engine for image databases.
Polynomial techniques for investigation of spherical designs
Authors: Silvia Boumova, Peter Boyvalenkov, Hristina Kulina, Maya Stoyanova
Venue: Designs, Codes and Cryptography (2009)

We investigate the structure of spherical ¿-designs by applying polynomial techniques for investigation of some inner products of such designs. Our approach can be used for large variety of parameters (dimension, cardinality, strength). We obtain new upper bounds for the largest inner product, lower bounds for the smallest inner product and some other bounds. Applications are shown for proving nonexistence results either in small dimensions and in certain asymptotic process. In particular, we complete the classification of the cardinalities for which 3-designs on $${\mathbb{S}^{n-1}}$$ exist for n = 8, 13, 14 and 18. We also obtain new asymptotic lower bound on the minimum possible odd cardinality of 3-designs.
Hierarchical QoS-Aware Routing in Multi-tier Wireless Multimedia Sensor Networks
Authors: Stephane Lohier, Gilles Roussel, Yacine Ghamri Doudane
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

The Wireless Multimedia Sensor Networks (WMSN) are a particular case of Wireless Sensors Networks (WSN) as they present a lower density, a limited mobility, require more important resources and need QoS control to transport the multimedia streams. In this paper, we propose, starting from a reference architecture of WMSN, a first approach for hierarchical self-organizing routing ensuring a certain level of QoS.
Microsoft Office Word 2007: Illustrated Brief, Spanish Edition, 1st edition
Authors: Jennifer Duffy
Venue:  (2008)

Now available in Spanish! This Microsoft Office 2007 Illustrated Series book covers the essential information that you need to know about how to use Microsoft Word 2007. Our signature two-page spread design has been updated and refreshed to take full advantage of the new features of the Office 2007 software. This practical, easy to navigate book provides you with the essential knowledge you need to succeed at both work and beyond.
Computerized weighted voting reapportionment
Authors: L. Papayanopoulos
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

A general model of a weighted voting legislature is described. The voting power of each of the N members is measured using the Banzhaf index. The voting power vector is a function of the vector of voting weights. An optimal weighted voting plan is one in which the voting powers are proportional to the respective constituencies. The optimization procedure is described in general terms and is demonstrated through real examples.
Introducing "Insecure IT"
Authors: Rick Kuhn, Hart Rossman, Simon Liu
Venue: IT Professional (2009)

This article introduces "Insecure IT", a new department for IT Professional that will cover security weaknesses in IT systems, ranging from desktops to global e-commerce networks. This regular feature will offer ideas to improve IT security, both by looking at ways it can go wrong as well as by covering good practices.
Small Area Drawings of Outerplanar Graphs
Authors: Giuseppe Di Battista, Fabrizio Frati
Venue: Algorithmica (2009)

We show three linear-time algorithms for constructing planar straight-line grid drawings of outerplanar graphs. The first and the second algorithm are for balanced outerplanar graphs. Both require linear area. The drawings produced by the first algorithm are not outerplanar while those produced by the second algorithm are. On the other hand, the first algorithm constructs drawings with better angular resolution. The third algorithm constructs outerplanar drawings of general outerplanar graphs with O(n 1.48) area. Further, we study the interplay between the area requirements of the drawings of an outerplanar graph and the area requirements of a special class of drawings of its dual tree.
Massive model visualization using realtime ray tracing
Authors: Andreas Dietrich, Philipp Slusallek
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

In the last years real-time ray tracing has become an attractive alternative to rasterization based rendering, particularly for highly complex datasets including both surface and volume data. Ray tracing [7, 15] is a much more flexible rendering algorithm than triangle rasterization found in most of todays graphics cards. Employing it in a real-time context might at first sound a bit surprising as ray tracing is mostly known for its application in high-quality off-line image generation, as e.g. in the motion picture industry. Infamous for its long rendering times, ray tracing was not used for interactive purposes until recently [13, 14, 19].
Fast Offline Partial Evaluation of Large Logic Programs
Authors: Michael Leuschel, Germán Vidal
Venue: Logic-Based Program Synthesis and Transformation: 18th International Symposium, LOPSTR 2008, Valencia, Spain, July 17-18, 2008, Revised Selected Papers (2009)

In this paper, we present a fast binding-time analysis (BTA) by integrating a size-change analysis, which is independent of a selection rule, into a classical BTA for offline partial evaluation of logic programs. In contrast to previous approaches, the new BTA is conceptually simpler and considerably faster, scaling to medium-sized or even large examples and, moreover, it ensures both the so called local and global termination. We also show that through the use of selective hints, we can achieve both good specialisation results and a fast BTA and specialisation process.
MCITP: Windows Server 2008 Server Administrator Certification Kit, Pap/Com edition edition
Authors: James Chellis, William Panek, Tylor Wentworth, Darril Gibson
Venue:  (2008)

Prepare yourself for the three required exams necessary to achieve your MCITP: Server Administrator certification with MCITP: Windows Server 2008 Server Administrator Certification Kit, which includes the three study guides that you will need. These guides will provide complete coverage of exam material, exam objectives, real world scenarios, hands-on exercises and challenging review questions both in the books and on accompanying CDs. You will find the MCTS: Windows Server 2008 Active Directory Configuration Study Guide, the MCTS: Windows Server 2008 Network Infrastructure Configuration Study Guide, and the MCITP: Windows Server 2008 Server Administrator Study Guide.
Pipeline Scheduling with Input Port Constraints for an FPGA-Based Biochemical Simulator
Authors: Tomoya Ishimori, Hideki Yamada, Yuichiro Shibata, Yasunori Osana, Masato Yoshimi, Yuri Nishikawa, Hideharu Amano, Akira Funahashi, Noriko Hiroi, Kiyoshi Oguri
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

This paper discusses design methodology of high-throughput arithmetic pipeline modules for an FPGA-based biochemical simulator. Since limitation of data-input bandwidth caused by port constraints often has a negative impact on pipeline scheduling results, we propose a priority assignment method of input data which enables efficient arithmetic pipeline scheduling under given input port constraints. Evaluation results with frequently used rate-law functions in biochemical models revealed that the proposed method achieved shorter latency compared to ASAP and ALAP scheduling with random input orders, reducing hardware costs by 17.57 % and by 27.43 % on average, respectively.
A New Design without Pressure Fluctuation for the Dynamic and Static Triaxial Instrument
Authors: Yong Sang, Longtan Shao
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Triaxial test instrument (include static triaxial test instrument and dynamic triaxial test instrument) that used to measure the soil’s strength, the soil’s stress-strain and other mechanical properties is very important equipment for studying the structure characteristic of the soil. According to the soil test requirements, a new dynamic&static triaxial instrument has been developed in this paper. This instrument could replace the dynamic triaxial instrument and the static triaxial instrument to accomplish the testing task perfectly. In order to ensure the servo loading system with good dynamic response and steady accuracy, the electro-hydraulic servo loading system has been adopted. The problem (How to reduce the pressure fluctuations for achieving high accuracy when dynamic loading) that brought by the hydraulic servo loading system are mainly discussed in this paper. The system structure of the servo loading system and the design of the hydraulic power have been introduced. A design project of the hydraulic system with the accumulators has been proposed to resolve the pressure fluctuating problem when dynamic loading. The mathematical model of the loading system has been made for simulation study. A series of experiments are performed, and the results show that the new design is satisfactory.
Test infrastructure design for core-based system-on-chip under cycle-accurate thermal constraints
Authors: Thomas Edison Yu, Tomokazu Yoneda, Krishnendu Chakrabarty, Hideo Fujiwara
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

We present a thermal-aware test-access mechanism (TAM) design and test scheduling method for system-on-chip (SOC) integrated circuits. The proposed method uses cycle-accurate power profiles for thermal simulation; it also relies on test-set partitioning, test interleaving, and bandwidth matching. We use a computationally tractable thermal-cost model to ensure that temperature constraints are satisfied and the test application time is minimized. Simulation results for the ITC'02 SOC Test Benchmarks show that, compared to prior thermal-aware test-scheduling techniques, the proposed method leads to shorter test times under tight temperature constraints.
A multidimensional linear distinguishing attack on the Shannon cipher
Authors: Risto M. Hakala, Kaisa Nyberg
Venue: International Journal of Applied Cryptography (2009)

In this article, we present a linear distinguishing attack on the stream cipher Shannon. Our distinguisher can distinguish the output keystream of Shannon from about 2107 keystream words while using an array of 232 counters. The distinguisher makes use of a multidimensional linear transformation instead of a 1D transformation, which is traditionally used in linear distinguishing attacks. This gives a clear improvement to the keystream requirement: we need approximately 25 times less keystream than when a 1D transformation is used. In addition, we give evidence of the correctness of the distinguisher by applying it to a smaller version of Shannon.
Privately detecting bursts in streaming, distributed time series data
Authors: Lisa Singh, Mehmet Sayal
Venue: Data Knowledge Engineering (2009)

Surprisingly, privacy preservation in the context of streaming data has received limited attention from computer scientists. In this paper, we consider privacy preservation in the context of independently owned, distributed data streams. Specifically, we want to protect the privacy of each individual participant's data stream while identifying bursts that exist across participant streams. We define two types of privacy breaches, data breaches and envelope breaches. In order to protect individual data, each participant transforms large subsets of the stream into small vectors that approximate the stream. These small vectors are calculated by summing coefficients of wavelet transforms at different resolutions. The participants share their vectors using bursty, self-eliminating noise. The combined participant vectors can then be used to detect bursts. We find that our approach leads to accurate burst detection results with reduced communication costs. We demonstrate these findings using both real and synthetic data.