ppxscal/embedding_network huggingface dataset:
Voltage-pulse driven harmonic resonant rail drivers for low-power applications
Authors: Joong-Seok Moon, William C. Athas, Sigfrid D. Soli, Jeffrey T. Draper, Peter A. Beerel
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

We describe a new design technique for efficient harmonic resonant rail drivers. The proposed circuit implementation is coupled to a standard pulse source and uses only discrete passive components and no external dc power supply. It can thus be externally tuned to minimize the consumed power in the target IC. A new design technique based on current-fed voltage pulse-forming network theory is proposed to find the value of each discrete component for a target frequency and a given load capacitance. The proposed circuit topology can be used to generate any desired periodic 50% duty-cycle waveform by superimposing multiple harmonics of the desired waveform, however, this paper focuses on the generation of trapezoidal-wave clock signals. We have tested the driver with a capacitive load between 38.3 and 97.8 pF with clock frequency ranging between 0.8 and 15 MHz. The overall power dissipation for our second-order harmonic rail driver is 19% of fCLV2 at 15 MHz and 97.8 pF load.
Knowledge management through end user developed expert systems: potential and limitations
Authors: Christian Wagner
Venue: Advanced topics in end user computing (2003)

Knowledge is receiving recognition as a strategic force in organizations. Correspondingly, one form of knowledge capture and maintenance organizations are tempted to use is expert system design by end users. The chapter discusses difficulties associated with end-user development, both in terms of design quality and knowledge content. An analysis of 25 expert systems written by non-professional developers reveals significant quality and size limitations that indicate limited feasibility of end-user expert system development. Furthermore, the lack of design quality may not be easily compensated for by a "knowledge advantage" of the end users, as end users may have a performance advantage in using their knowledge, but not in "knowing" it. The chapter then offers suggestions for alternate forms of end-user oriented expert system development that considers end-user limitations and takes advantage of recent developments in information technology.
Reliability-Aware IBGP Route Re.ection Topology Design
Authors: Li Xiao, Jun Wang, Klara Nahrstedt
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

In the Internal Border Gateway Protocol (IBGP), route reflection is widely used as an alternative to full mesh IBGP sessions inside an AS for scalability reason. However, some important issues, such as the impact of route reflection on the reliability of IBGP and the construction of reliable reflection topology with unreliable routers or links, have not been wellinvestigated.This paper addresses the problem of finding reliable route reflection topologies for IBGP networks, which is of great importance to increase the robustness of IBGP operations. Wefirst present a novel reliability model and two new metrics (IBGP expected lifetime and expected session loss) to evaluate the reliability of reflection topologies, and further to investigate the design problem. After studying the solvability conditions under the router capacity constraints, we prove the NP-hardness of the problem, and then design and implement three heuristic solutions using randomization techniques: heuristic selection, greedy search and simulated annealing. Our extensive computational experiments show that the reliability of IBGP reflection network can be significantly improved by our solutions.
Face recognition with visible and thermal infrared imagery
Authors: Diego A. Socolinsky, Andrea Selinger, Joshua D. Neuheisel
Venue: Computer Vision and Image Understanding (2003)

We present a comprehensive performance study of multiple appearance-based face recognition methodologies, on visible and thermal infrared imagery. We compare algorithms within the same imaging modality as well as between them. Both identification and verification scenarios are considered, and appropriate performance statistics reported for each case. Our experimental design is aimed at gaining full understanding of algorithm performance under varying conditions, and is based on Monte Carlo analysis of performance measures. This analysis reveals that under many circumstances, using thermal infrared imagery yields higher performance, while in other cases performance in both modalities is equivalent. Performance increases further when algorithms on visible and thermal infrared imagery are fused. Our study also provides a partial explanation for the multiple contradictory claims in the literature regarding performance of various algorithms on visible data sets.
Towards a general ontology of configuration
Authors: Timo Soininen, Juha Tiihonen, Tomi Männistö, Reijo Sulonen
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

This article presents a generalized ontology of product configuration as a step towards a general ontology of configuration, which is needed to reuse and share configuration knowledge. The ontology presented consists of a set of concepts for representing the knowledge on a configuration and the restrictions on possible configurations. The ontology is based on a synthesis of the main approaches to configuration. Earlier approaches are extended with new concepts arising from our practical experience on configurable products. The concepts include components, attributes, resources, ports, contexts, functions, constraints, and relations between these. The main contributions of this work are in the detailed conceptualization of knowledge on product structures and in extending the resource concept with contexts for limiting the availability and use of resources. In addition, constraint sets representing different views on the product are introduced. The ontology is compared with the previous work on configuration. It covers all the principal approaches, that is, connection-based, structure-based, resource-based, and function-based approaches to configuration. The dependencies between the concepts arising from different conceptualizations are briefly analyzed. Several ways in which the ontology could be extended are pointed out.
Greedy algorithms for classification&mdash;consistency, convergence rates, and adaptivity
Authors: Shie Mannor, Ron Meir, Tong Zhang
Venue: The Journal of Machine Learning Research (2003)

Many regression and classification algorithms proposed over the years can be described as greedy procedures for the stagewise minimization of an appropriate cost function. Some examples include additive models, matching pursuit, and boosting. In this work we focus on the classification problem, for which many recent algorithms have been proposed and applied successfully. For a specific regularized form of greedy stagewise optimization, we prove consistency of the approach under rather general conditions. Focusing on specific classes of problems we provide conditions under which our greedy procedure achieves the (nearly) minimax rate of convergence, implying that the procedure cannot be improved in a worst case setting. We also construct a fully adaptive procedure, which, without knowing the smoothness parameter of the decision boundary, converges at the same rate as if the smoothness parameter were known.
Enhancing web accessibility
Authors: Alison Lee, Vicki Hanson
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This demonstration will illustrate the key technical and user interface aspects of the Web Adaptation Technology. Various transformations underlying the system will be shown that illustrate how this approach enables a wide range of users with reduced visual, cognitive, and motor abilities to access a large proportion of Web pages using a standard browser.
A Dynamic Voltage Scaling Algorithm for Sporadic Tasks
Authors: Ala' Qadi, Steve Goddard, Shane Farritor
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Dynamic voltage scaling (DVS) algorithms save energyby scaling down the processor frequency when the processoris not fully loaded. Many algorithms have been proposedfor periodic and aperiodic task models but none support thecanonical sporadic task model. A DVS algorithm, calledDVSST, is presented that can be used with sporadic tasksin conjunction with preemptive EDF scheduling. The algorithmis proven to guarantee each task meets its deadlinewhile saving the maximum amount of energy possible withprocessor frequency scaling.DVSST was implemented in the µC/OS-II real-time operatingsystem for embedded systems and its overheadwas measured using a stand-alone Rabbit 2000 test board.Though theoretically optimal, the actual power savings realizedwith DVSST is a function of the sporadic task set andthe processor's DVS support. It is shown that the DVSST algorithmachieves 83% of the theoretical power savings for aRobotic Highway Safety Marker real-time application. Thedifference between the theoretical power savings and the actualpower savings is due to the limited number of frequencylevels the Rabbit 2000 processor supports.
Proactive Views on Concrete Aspects: A Pattern Documentation Approach for Software Evolution
Authors: T. H. Ng, S. C. Cheung
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

A design pattern provides a structure to manage a designaspect by allowing the aspect to be changed withoutsoftware redesign. For example, the Command patternallows a software design to be easily reconfigured toreplace a receiver of a command request or issue a newcommand request. To prepare for everlasting demands indiverse requirement changes, multiple design patterns aretypically deployed to manage various design aspects of asoftware program. However, this can complicate theunderlying program structure, resulting in difficulties ofsucceeding program revisions to preserve effectivemanagement of aspects. In particular, when design aspectscut across each other, realizing changes in one aspectlikely revokes the management of other aspects. Toaddress this problem, we propose a documentationapproach to govern program revisions. In the approach, adesign aspect is associated with a set of proactive views.Each view specifies how an implementation of the aspectis organized so that other aspects can be managed at thesame time. The views capture the class relationships thatmust be kept to preserve effective management of aspects.The approach is illustrated using a pattern-based hotelmanagement system.
On what exactly goes on when software is developed step-by-step, II: the sequel
Authors: Tom Maibaum
Venue: Information Processing Letters (2003)

At the workshop in honour of his 65th birthday, Wlad Turski reprised his professional life and, unusually for him, ended on a pessimistic note. He seemed to think that his and others' efforts to introduce systematic, mathematically based engineering methods for software had been a failure. The purpose of this article is to rehearse the contents of our 1984 ICSE paper [Maibaum, Turski, in: Proc. 7th Internat. Conf. on Software Engineering, 1984] about the formal construction of software and then review what has happened in the twenty or so intervening years. The article concludes by pointing to the half full glass of formally based achievements in software engineering, in contrast to the largely empty glasses of earlier times.
Composite multidatabase system concurrency control and recovery
Authors: Dexter P. Bradshaw
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Multidatabase systems based on single monolithic multidatabase servers are not realistic and do not scale with increases in the number of participant component database systems and the radius of service. In this paper, we focus on an architecture in which the multidatabase system consists of multiple, possibly heterogeneous peer servers distributed on a communication network. A global multidatabase request can span multiple servers, causing some servers to act as component database systems. We refer to this configuration as a composite multidatabase system.We examine the effect of multidatabase composition on global concurrency control algorithms proposed for single server systems. Our examination is simplified by assuming a homogeneous composite multidatabase system; that is, multiple instances of the same multidatabase server managing disjoint sets of component database systems. In particular, we look at two global concurrency control algaorithms for guaranteeing multidatabase serializability: site locking and forced conflicts. We propose a design for the composite counterparts of these algorithms to show that the task of adapting existing global concurrency control algorithms to composite multidatabase systems is non-trivial.
PCBA: a priority-based competitive broadcasting algorithm in mobile ad hoc networks
Authors: Bo Sheng Zhou, Jie Yi Wu, Xiang Fei, Jian Zhao
Venue: Journal of Computer Science and Technology (2003)

Broadcasting operations are of great importance in Mobile Ad Hoc Networks (MANETs) since they are frequently executed. A straightforward broadcasting by flooding will produce serious redundancy, contention and collision, and furthermore it will result in the performance degradation of the networks. PCBA, a Priority-based Competitive Broadcasting Algorithm, is proposed in this paper to solve the above problem. In this algorithm, hosts with larger Priority Index (PI) have higher probability to rebroadcast relevant messages while some other hosts will be prevented from rebroadcasting according to the competing policy. PCBA is a distributed algorithm and will not increase communication overhead. Through the analyses and extensive simulations, the authors demonstrate that PCBA has advantages in availability and scalability. It can significantly reduce the rebroadcast redundancy. In addition, PCBA can also be further used in other applications such as routing discovery schemes, enhancing the performance.
Congestion-induced collapse in networks: managing failure cascades in complex systems and infrastructure protection
Authors: Nicholas Bambos, William J. Perry
Venue:  (2003)

The national infrastructure systems of the United States form a complex mesh of interdependent networks. While technology advances in these infrastructures (e.g. telecommunications, transportation, electric power, etc.) have brought great efficiencies to modern life, our economic and social welfare have become inextricably dependent on them. Over the last decade, there has been growing concern over the vulnerability of national infrastructure systems to accidents, failures, and attacks. While there is significant evidence to support the belief that catastrophic cascading failures can and will happen in the future, there is so far little theory to understand how and why these failure cascades occur and propagate. There is even less known about what to do about them. This dissertation lends perspective and insight into this problem through the study of congestion-induced network failures. Using approaches from the study of dynamical systems and network flow problems, this research develops an analytical framework suitable for the study of this difficult, yet important problem. A series of deterministic and stochastic models is analyzed to obtain a quantitative and qualitative understanding of potential failures modes within stand-alone systems. Optimal management policies using admission control are developed to maximize system performance while preventing congestion collapse. The characteristics and parameter sensitivities of these policies are presented for a general class of congestion-sensitive systems. A primary objective in this study is to identify the tradeoffs in the operation and design of complex networks as well as to initiate the development of robust management strategies for critical infrastructure systems. Accordingly, the framework for standalone models is extended to address the behavior of simple network topologies, and it is shown how these systems, if uncontrolled, are susceptible to cascading failure events. Particular attention is placed on the application of this framework to current challenges in the management of large-scale infrastructure systems, including systems in transportation (interstate highway traffic and railroads) and computer networks (e.g. interacting Ethernet domains, distributed computing &ldquo;farms&rdquo;). The thesis concludes with an agenda for addressing the some of the long-term challenges of designing and managing large-scale infrastructure networks.
A feature ontology to support construction cost estimating
Authors: Sheryl Staub–french, Martin Fischer, John Kunz, Kos Ishii, Boyd Paulson
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2003)

Construction cost estimators are confronted with the challenging task of estimating the cost of constructing one of a kind facilities. They must first recognize the design conditions of the facility design that are important (i.e., incur a cost) and then determine how the design conditions affect the cost of construction. Current product models of facility designs explicitly represent components, attributes of components, and relationships between components. These designer-focused product models do not represent many of the cost-driving features of building product models, such as penetrations and component similarity. Previous research efforts identify many of the different features that affect construction costs, but they do not provide a formal and general way for practitioners to represent the features they care about according to their preferences. This paper presents the formal ontology we developed to represent construction knowledge about the cost-driving features of building product models. The ontology formalizes three classes of features, defines the attributes and functions of each feature type, and represents the relationships between the features explicitly. The descriptive semantics of the model allow estimators to represent their varied preferences for naming features, specifying features that result from component intersections and the similarity of components, and grouping features that affect a specific construction domain. A software prototype that implements the ontology enables estimators to transform designer-focused product models into estimator-focused, feature-based product models. Our tests show that estimators are able to generate and maintain cost estimates more accurately, consistently, and expeditiously with feature-based product models than with industry standard product models.
Measuring Functional Size of Interactive Software: A Support System Based on XForms-Format User Interface Specifications
Authors: Zhen Li, Makoto Nonaka, Akihiro Kakurai, Motoei Azuma
Venue: Proceedings of the Third International Conference on Quality Software (2003)

This study reports a measurement support system,which was developed based on the XForms-Format userinterface (UI) specifications in order to facilitate theprocess of measuring the functional size of interactivesoftware. XForms is the next generation of Web Forms.As it is capable of describing the purpose and thepresentation of the Web form separately, the semantics ofuser-computer interactions, which is essential to thefunctional size measurement (FSM), can be extractedfrom the specification. In this study, we propose severalextensions to the current W3C's XForms for itsapplication in FSM. The procedure of measuring thefunctional size, which was proposed in our past study, isfurther automated based on the XForms-Format UIspecifications. The interactive part of a car-navigationsoftware product was measured with the support systemand the results suggest that this system is effective ingenerating reliable results and reducing measurementcosts.
Game Development: Harder Than You Think
Authors: Jonathan Blow
Venue: Queue (2004)

The hardest part of making a game has always been the engineering. In times past, game engineering was mainly about low-level optimization—writing code that would run quickly on the target computer, leveraging clever little tricks whenever possible.
Algorithms for Colouring Random k-colourable Graphs
Authors: C. R. Subramanian
Venue: Combinatorics, Probability and Computing (2000)

The k-colouring problem is to colour a given k-colourable graph with k colours. This problem is known to be NP-hard even for fixed k &ge; 3. The best known polynomial time approximation algorithms require n&delta; (for a positive constant &delta; depending on k) colours to colour an arbitrary k-colourable n-vertex graph. The situation is entirely different if we look at the average performance of an algorithm rather than its worst-case performance. It is well known that a k-colourable graph drawn from certain classes of distributions can be k-coloured almost surely in polynomial time.In this paper, we present further results in this direction. We consider k-colourable graphs drawn from the random model in which each allowed edge is chosen independently with probability p(n) after initially partitioning the vertex set into k colour classes. We present polynomial time algorithms of two different types. The first type of algorithm always runs in polynomial time and succeeds almost surely. Algorithms of this type have been proposed before, but our algorithms have provably exponentially small failure probabilities. The second type of algorithm always succeeds and has polynomial running time on average. Such algorithms are more useful and more difficult to obtain than the first type of algorithms. Our algorithms work as long as p(n) &ge; n&minus;1+ε where ε is a constant greater than 1&#x002F;4.
Verifying Service Continuity in a Dynamic Reconfiguration Procedure: Application to a Satellite System
Authors: L. Apvrille, P. De Saqui-Sannes, P. Sénac, C. Lohr
Venue: Automated Software Engineering (2004)

The paper discusses the use of the TURTLE UML profile to model and verify service continuity during dynamic reconfiguration of embedded software, and space-based telecommunication software in particular. TURTLE extends UML class diagrams with composition operators, and activity diagrams with temporal operators. Translating TURTLE to the formal description technique RT-LOTOS gives the profile a formal semantics and makes it possible to reuse verification techniques implemented by the RTL, the RT-LOTOS toolkit developed at LAAS-CNRS. The paper proposes a modeling and formal validation methodology based on TURTLE and RTL, and discusses its application to a payload software application in charge of an embedded packet switch. The paper demonstrates the benefits of using TURTLE to prove service continuity for dynamic reconfiguration of embedded software.
Mining High Utility Itemsets
Authors: Raymond Chan, Qiang Yang, Yi-Dong Shen
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Traditional association rule mining algorithms onlygenerate a large number of highly frequent rules, butthese rules do not provide useful answers for what thehigh utility rules are. In this work, we develop a novelidea of top-K objective-directed data mining, which focuseson mining the top-K high utility closed patterns thatdirectly support a given business objective. To associationmining, we add the concept of utility to capture highly desirablestatistical patterns and present a level-wise item-setmining algorithm. With both positive and negativeutilities, the anti-monotone pruning strategy in Apriorialgorithm no longer holds. In response, we develop a newpruning strategy based on utilities that allow pruning oflow utility itemsets to be done by means of a weaker butanti-monotonic condition. Our experimental results showthat our algorithm does not require a user specifiedminimum utility and hence is effective in practice.