ppxscal/embedding_network huggingface dataset:
A High Efficiency 3GHz 24-dBm CMOS Linear Power Amplifier for RF Application
Authors: S. M. Rezaul Hasan
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper presents an improved CMOS class AB power amplifier for Radio Frequency (RF) applications. The power amplifier along with the pre-amplification stage has a fully differential structure suitable for mixed-signal System-On-Chip (SOC) implementation. Thorough simulations using a 3V single-ended power supply and 0.18µm TSMC CMOS process technology indicate a capability to deliver 24dBm to a 50.. antenna at a resonant frequency of 3GHz with a drain efficiency of almost 50%. In addition, the transient output waveform (@ 3GHz) indicates a high degree of linearity in the output with a Total Harmonic Distortion (THD) of around -58dB.
Mapping the Course, Marking the Trail
Authors: Bernadette E. Clemente, Victor J. Pollara
Venue: IT Professional (2005)

According to cognitive scientists, humans tend to be informavores--they forage for information, converting representations of the outside world into mental models. The traditional approach to knowledge management is to improve the flow of knowledge within a group by recording and making available what its members know. But a more recent trend, known as the personal knowledge management (PKM) approach, focuses on the individual and his or her quest to find, connect, learn, and explore.
Teaching an Active-Participation University Course in Software Reliability and Testing
Authors: Laurie Williams
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

A large percentage of software development costs are spent on software reliability and testing. However, many practicing software engineers and graduate students in computer science have never taken a course in software reliability or software testing. A graduate-level software engineering course at North Carolina State University provides instruction in these topics to better prepare current and future software engineers for the software reliability and testing challenges. The course takes place in a laboratory setting such that students can learn testing and reliability theory and apply this theory immediately.
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
Authors: UmaMaheswari C. Devi, James H. Anderson
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

This paper considers the scheduling of soft real-time sporadic task systems under global EDF on an identical multiprocessor. Prior research on global EDF has focussed mostly on hard real-time systems, where, to ensure that all deadlines are met, approximately 50% of the available processing capacity will have to be sacrificed in the worst case. This may be overkill for soft real-time systems that can tolerate bounded tardiness. In this paper, we derive tardiness bounds under preemptive and non-preemptive global EDF on multiprocessors when the total utilization of a task system is not restricted and may equal the number of processors. Our tardiness bounds depend on per-task utilizations and execution costs — the lower these values, the lower the tardiness bounds. As a final remark, we note that global EDF may be superior to partitioned EDF for multiprocessor-based soft real-time systems in that the latter does not offer any scope to improve system utilization even if bounded tardiness can be tolerated.
Review and Enhancement of Cautious Parameter Estimation for Model Based Control: A Specific Realisation of Regularisation
Authors: J. Linden, B. Vinsonneau, K. J. Burnham
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This paper reviews a method of cautious parameter estimation which was proposed initially for estimating models of industrial processes for the purpose of model based control. Essentially, the method is able to influence the resulting estimation algorithm by introducing 'fictitious' measurements which correspond to a priori knowledge of the values of specific model parameters. The paper shows that the method is a particular realisation of regularisation. Enhancements to the original method are also proposed.
Creating non-decomposable stream bundles in multimedia web services using uSMIL
Authors: Naren Kodali, Csilla Farkas, Duminda Wijesekera
Venue: Proceedings of the 2004 workshop on Secure web service (2004)

Technical advances in networks, operating systems and web based services are enabling new web-based services such as audiovisual surveillance, monitoring and recording of unfolding real world scenes. Leaving room to alter the chronology of such real-world recordings would facilitate the ability to fabricate audiovisual evidence, thereby seriously eroding emerging public trust on these up and coming services. One way of avoiding this problem is to be able to specify which chronology building composition operators - otherwise known as multimedia synchronization constructs - such as before, after, simultaneously etc., have more rigid failure semantics. Existing W3C standard for multimedia services, the synchronized multimedia integration language (SMIL) does not provide them. In order to address this deficiency, we propose uSMIL - an extension of SMIL that allows the creation of non-decomposable stream bundles with an all or nothing playout semantics. Here we present a report on our work in progress that defines a formal operational semantics for uSMIL and show some of its algebraic properties.
An Automatic Layout Generator for I/O Cells
Authors: Li-Chun Tien, Jing-Jou Tang, Mi-Chang Chang
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

We present a new design methodology for I/O cell library design automation. It¿s different from the conventional cell library compilers or generators, which generate the cells for standard cells or regular structures (e.g., SRAM). The proposed compiler will generate I/O cells based on a set of parameterized unit-cells with the features of scalable geometry dependence. The compilation results of the I/O cells have been proved in a 0.13um LOGIC 1P8M process. Through this compiler, the number of unit-cells needed to be maintained is dramatically reduced, thereby reducing library development costs and time to market.
Notes on hiring
Authors: Diana Patterson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

This is not the sort of stuff Joe Rigo thinks is "hard core" technical writing, but when you see a bungled job you know it will have a telling effect on a long line of documents. In the last three weeks I have watched a nouveau publications department manager and a personnel officer hire two writers and a repro typist/terminal operator. They did it totally without consultation and without writing or typing samples. The terminal operator was chosen because she was a "good looker", one technical writer on his interview handling abilities, the second because her father is an author. None of them has any functional idea about what the job he has been hired to do entails. 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
High Resolution Aerospace Applications using the NASA Columbia Supercomputer
Authors: Dimitri J. Mavriplis, Michael J. Aftosmis, Marsha Berger
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

This paper focuses on the parallel performance of two high-performance aerodynamic simulation packages on the newly installed NASA Columbia supercomputer. These packages include both a high-fidelity, unstructured, Reynolds-averaged Navier-Stokes solver, and a fully-automated inviscid flow package for cut-cell Cartesian grids. The complementary combination of these two simulation codes enables high-fidelity characterization of aerospace vehicle design performance over the entire flight envelope through extensive parametric analysis and detailed simulation of critical regions of the flight envelope. Both packages are industrial-level codes designed for complex geometry and incorporate customized multigrid solution algorithms. The performance of these codes on Columbia is examined using both MPI and OpenMP and using both the NUMAlink and InfiniBand interconnect fabrics. Numerical results demonstrate good scalability on up to 2016 cpus using the NUMAlink4 interconnect, with measured computational rates in the vicinity of 3 TFLOP/s, while InfiniBand showed some performance degradation at high CPU counts, particularly with multigrid. Nonetheless, the results are encouraging enough to indicate that larger test cases using combined MPI/OpenMP communication should scale well on even more processors.
Review of "Models for Environmental Pollution Control, by Rolf A. Deininger", Ann Arbor Science Publishers, 1974
Venue: ACM SIGSIM Simulation Digest (1976)

This volume is currently in its second printing and represents the efforts of an international group of experts to present the concepts of mathematical modeling and systems analysis techniques as applied to environmental pollution control. There are 20 different chapters in six sections in this book; the sections deal with water pollution control, water supply and water resources development, air pollution control, solid waste disposal, noise control and two total environmental models. 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
Automatically generated lower bounds for search
Authors: Istvan T. Hernadvolgyi
Venue:  (2004)

Heuristic search algorithms (eg. A* and IDA*) with accurate lower bounds can solve impressively large problems optimally. Most lower bounds, such as the well known Manhattan Distance heuristic for the sliding-tile puzzles or the Assignment Problem lower bound for the Asymmetric Traveling Salesman problem, are the products of human ingenuity and insight. An alternative approach to obtain lower bounds is to precalculate shortest distances in an abstraction of the original search space which is derived automatically and store the bounds in pattern databases (look-up tables). This latter technique, based on the ideas of Culberson and Schaeffer, gained popularity when Korf for the first time solved random instances of Rubik's Cube using pattern databases. While researchers were pushing for solving larger and larger problems, the fact that there exist a very large number of abstract spaces that can provide lower bounds was overlooked. This thesis fills this gap in research by investigating the search performance of lower bounds derived from abstractions. We also use the results of this analysis to automatically derive high performance pattern databases. First, we establish a very predictable trade-off between search speed and the number of entries in the pattern database. Second, we derive simple statistics that can predict the search performance of pattern databases without performing actual searches in the original state space. Using these results, we derive high performance pattern databases to search for macro-operators and to solve challenging instances of the well known Sequential Ordering Problem (SOP). Macro-search is a good candidate to showcase automatically derived lower bounds since there are many search spaces and each needs a different lower bound. The SOP is an NP-hard optimization problem. We were able to solve an unsolved instance from the TSPLIB. This required a greedy search in the space of abstractions to find a sufficiently accurate lower bound and several novel enhancements to the basic branch and bound algorithm.
Making SVMs Scalable to Large Data Sets using Hierarchical Cluster Indexing
Authors: Hwanjo Yu, Jiong Yang, Jiawei Han, Xiaolei Li
Venue: Data Mining and Knowledge Discovery (2005)

Support vector machines (SVMs) have been promising methods for classification and regression analysis due to their solid mathematical foundations, which include two desirable properties: margin maximization and nonlinear classification using kernels. However, despite these prominent properties, SVMs are usually not chosen for large-scale data mining problems because their training complexity is highly dependent on the data set size. Unlike traditional pattern recognition and machine learning, real-world data mining applications often involve huge numbers of data records. Thus it is too expensive to perform multiple scans on the entire data set, and it is also infeasible to put the data set in memory. This paper presents a method, Clustering-Based SVM (CB-SVM), that maximizes the SVM performance for very large data sets given a limited amount of resource, e.g., memory. CB-SVM applies a hierarchical micro-clustering algorithm that scans the entire data set only once to provide an SVM with high quality samples. These samples carry statistical summaries of the data and maximize the benefit of learning. Our analyses show that the training complexity of CB-SVM is quadratically dependent on the number of support vectors, which is usually much less than that of the entire data set. Our experiments on synthetic and real-world data sets show that CB-SVM is highly scalable for very large data sets and very accurate in terms of classification.
EDP application mix selection using zero-one programming
Authors: Susan L. Solomon
Venue: Issue 24 (September 1978) (1978)

The problem of selecting a data processing system and determining the set of applications to be performed by the chosen system is one which confronts more as well as smaller firms every year. The use of management science techniques in making these crucial decisions has been very limited. Some firms which can afford the relatively high cost of doing so have implemented simulation packages {10, 25} or written a custom simulation model to assist in the selection or modification of hardware and software systems. Occasionally, simulation is used to evaluate alternative data management schemes after the equipment has been chosen. In all such situations the application mix is taken as given. The firm which cannot or will not undertake such a heavy commitment of funds is left with traditional system evaluation aids such as benchmarks or subjective assessments. These methods are unrigourous and imprecise and, again, the application set is assumed fixed.
Chord6: IPv6 Based Topology-Aware Chord
Authors: Jiping Xiong, Youwei Zhang, Peilin Hong, Jinsheng Li
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Chord, in its original design, does not take into account physical network topology, thus resulting in high routing latency and low efficiency. As the entire Internet is being currently upgraded from IPv4 to IPv6 worldwide, we devise a smart scheme to exploit the IPv6 address hierarchical feature, so as to construct an efficient version of Chord dubbed Chord6. Simulation results have shown that our method can significantly reduce inter-domain traffic that causes the long routing latency. Another advantage of our scheme is that it is very simple and barely modifies the original Chord.
Certain computational aspects of power efficiency and of state space models
Authors: Richard Edward Gagnon
Venue:  (2005)

A semiparametric approach to the one-way layout is described, and its efficiency in the two-sample case relative to the common t-test is studied. The power efficiency computed for several special cases points to an intriguing behaviour where one test may be more efficient than the other over a certain parameter range and less efficient over another parameter range. Given two random samples from two distributions, the method holds one distribution as the &ldquo;reference&rdquo; and treats the other distribution as a &ldquo;distortion&rdquo; of the reference. The combined sample is used in the semiparametric estimation of the reference and distortion distributions, and in testing the hypothesis of distribution equality. In order to calculate relative power efficiencies, the asymptotic distributions of the semiparametric and t-test statistics are used in approximating the finite sample distributions of the statistics. Relative power simulations for several special cases show that the theoretical results compare favorably with the finite sample simulation results. A likelihood approach is employed in deriving a state space smoother, based on a linear state space model between an unobserved &ldquo;state&rdquo; time series and an observed time series. A state space smoother provides an algorithm for calculating the conditional mean of any state given the available observations, called smoother estimate, and for calculating the variance of any residual obtained as the difference between a state and its smoother estimate, called smoother precision. Bounds and asymptotic limits are developed for the smoother precisions under the assumption of a univariate state space model. An extension for missing observations handles the special case of prediction. A partial state space smoother is introduced. It provides a smoother like estimate of each state and relies only on a limited number of future observations.
Multi-Input Fuzzy control of an inverted pendulum using an armature controlled DC motor
Authors: Hosein Marzi
Venue: Robotica (2005)

This paper presents a design methodology to stabilize a class of multi-variant nonlinear system after a high disturbance occurs. It investigates application of Takagi-Sugeno type fuzzy controller (T-S-FC) to an inverted pendulum mechanism, actuated by an armature-controlled DC electrical motor.Fuzzy controllers use heuristic information in developing design methodologies for control of non-linear dynamic systems. This approach eliminates the need for comprehensive knowledge and mathematical modeling of the system, and in cases of more complex systems, approximation and simplifications in order to achieve feasible mathematical model is not required.The paper presents the stages of development of the Fuzzy Controller for an inverted pendulum by developing a two-input, Mamdani type system. It evaluates the performance of the system. Then a four-input T-S-FC type is developed. The research compares performances of each controller and presents the result of tests. A model for a DC motor is developed in this study, in order to measure the effect of time delays and response time caused by inherent properties of the physical system. The final part will demonstrate the complete operational system with the DC electrical motor included in the test system.
Behavioral analysis of asymmetric information sharing on Lumisight Table
Authors: Masafumi Matsuda, Mitsunori Matsushita, Tatsumi Yamada, Takeshi Namemura
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

This research reveals the factors important in designing a group support environment by focusing on a distributed cognitive environment where group members have different information. We find that closeness within a group enhances group performance when group members use a tabletop CSCW environment. To confirm this, we conduct experiments that observe human behavior in a distributed cognitive environment. Participants play a maze game in which players with restricted and distributed information communicate with each other to catch a rapidly moving target. Group performance in two CSCW environments was compared: a normal LCD setup that prevented indirect communication and a tabletop display, Lumisight Table. Group performance was found to be higher with the tabletop display, and the performance advantage was reinforced by the closeness of the group members.
Finding useful fuzzy concepts for pattern classification using genetic algorithm
Authors: Yi-Chung Hu
Venue: Information Sciences: an International Journal (2005)

In this paper, a fuzzy classifier is treated as a fuzzy information retrieval system. To construct such a system, a fuzzy data mining method is employed to determine useful fuzzy concepts. Subsequently, each of the classes and patterns can be represented by a fuzzy set of useful fuzzy concepts. From the viewpoint of fuzzy information retrieval, a pattern can be categorized into one class if there exists a maximum degree of similarity between them. The genetic algorithm (GA), whose objective is to find a compact set consisting of useful fuzzy concepts with high classification capability, is further employed to automatically determine parameter specifications that are not easily specified by users. To evaluate classification performance of the proposed method, computer simulations are performed on some well-known classification problems, demonstrating that the generalization ability of the proposed method is comparable to other fuzzy classification methods.
A Distributed Algorithm based on Probability for Refining Energy-Efficiency of Multicast Trees in Ad Hoc Networks
Authors: Yuhong Luo, Jianxin Wang, Jianer Chen, Songqiao Chen
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

A distributed algorithm called P-REMiT is proposed for building an energy-efficient multicast tree in ad hoc networks. The P-REMiT uses the probability method to balance the Total Energy Consumption (TEC) and System Lifetime (SL) of multicast tree. It gets the better performance than SREMiT on metrics about system life and also obtains the better performance than L-REMiT on metrics about TEC. It improves SL of multicast tree efficiently with little sacrifice on TEC and has good convergence.
Fault Attacks on Dual-Rail Encoded Systems
Authors: Jason Waddle, David Wagner
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Fault induction attacks are a serious concern for designers of secure embedded systems. An ideal solution would be a generic circuit transformation that would produce circuits that are robust against fault induction attacks. We develop a framework for analyzing the security of systems against single fault attacks and apply it to a recent proposed method (dual-rail encoding) for generically securing circuits against single fault attacks. Ultimately, we find that the method does not hold up under our threat models: n-bit cryptographic keys can be extracted from the device with roughly n trials. We conclude that secure designs should incorporate explicit countermeasures to either directly address or attempt to invalidate our threat models.
Determining structure in continuously recorded videos
Authors: Yun Zhai, Mubarak Shah
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we present a scene detection framework on continuously recorded videos. Conventional temporal scene segmentation methods work for the videos composed of discrete shots, where shot boundaries are clearly defined. The proposed method detects scene segments by the spectral clustering technique and fuzzy analysis. The detected scenes are represented by the corresponding representative feature values of the feature clusters, rather than abrupt temporal boundaries. The feature clusters are generated using the spectral clustering technique. The video units have the fuzzy memberships to the feature clusters, which are generated using the Hyperbolic tangent fuzzy function. The final output is collected from the candidate scenes from all clusters. The proposed method has been tested on several video sequences, and very promising results have been obtained.