ppxscal/embedding_network huggingface dataset:
From Ligatures to Characters: A Shape-Based Algorithm for Handwriting Segmentation
Authors: Claudio De Stefano, Angelo Marcelli
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper presents a method for locating the points where most likely joints between successive characters within a word occur. The proposed method, whose basic assumptions follow from handwriting generation studies, relies upon a set of morphological criteria applied to both the ligatures and the terminal regions of successive characters in order to decide the most appropriate position for the segmentation points. It does not exploit any temporal information, but rather it manipulates shape information, thus being suitable for both on-line and off-line handwriting processing. An experimental procedure, adopted to quantitatively evaluate the performance of the proposed algorithm without using any classification method, is also introduced.
Hybrid sampling series associated with orthogonal wavelets and Gibbs phenomenon
Authors: Hong-Tae Shim, Gilbert G. Walter
Venue: The Korean Journal of Computational Applied Mathematics (2003)

When a sampling theorem holds in wavelet subspaces, sampling expansions can be a good approximation to projection expansions. Even when the sampling theorem does not hold, the scaling function series with the usual coefficients replaced by sampled function values may also be a good approximation to the projection. We refer to such series as hybrid sampling series. For this series, we shall investigate the local convergence and analyze Gibbs phenomenon.
Demand-based Document Dissemination for the World-Wide Web
Authors: Azer Bestavros
Venue:  (1995)

Abstract We analyzed the logs of the cs-www.bu.edu HTTP server for the month of January 1995. Our analysis showed that remote HTTP accesses were confined to a small subset of documents. Using an analytical model of server popularity and file access profiles, we show that by disseminating the most popular documents on servers (proxies) closer to the clients, network traffic could be reduced considerably, while server loads are balanced. We argue that this process could be generalized so as to provide for an automated demand-based duplication of documents. We believe that such server-based information dissemination protocols will be more effective at reducing both network bandwidth and document retrieval times than client-based caching protocols.
Fuzzy pseudo-ideals of pseudo-BCKalgebras
Authors: Young Bae Jun, Seok Zun Song
Venue: The Korean Journal of Computational Applied Mathematics (2003)

The fuzzification of (positive implicative) pseudo-ideals in a pseudo-BCK algebra is discussed, and several properties are investigated. Characterizations of a fuzzy pseudo-ideal are displayed.
Designing Hypermedia Documentation for Safety Critical Applications
Authors: R. M. Newman
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper discusses the requirements for authoring methodologies for large multimedia systems to be used for technical documentation in the domain of 'safety critical' industries. In such industries, the documentation used to support maintenance and repair may itself be safety critical, in that incorrect documentation can lead to incorrect maintenance procedures. Design issues for such systems include those of the verifiable, in terms of both their content and other issues such as sequence of presentation. It is argued that the addressing of these issues is essential to the development of technical documentation systems that are of sufficient quality to be used for safety critical applications such a within the transport industry. The requirements that viable design methodologies for these applications must address are discussed, and a methodology is proposed, based on traditional authoring methods and process algebra based formal specification and verification.
What Do You Mean I'm Practicing Without a License? Certification and Licensing of Requirements Engineering Professionals
Authors: Nancy R. Mead
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

During the past few years, we have seen some dramatic events that support licensing and certification of software professionals. The decision to license software engineers in the state of Texas was a landmark event. Other significant events include the establishment of undergraduate degree programs in software engineering, the merger of the CSAB and ABET accrediting bodies, and the plan to accredit undergraduate degree programs in software engineering. The work of the SWECC and other groups such as the WGSEET all point in the direction of a discipline of software engineering that can support licensing and certification. I have long felt that licensing or certification of software engineers was inevitable, at least for developers of products that need to exhibit safety and security properties. Our inclination to sue may also lead to licensing of software engineers who develop essential business applications. The issues to be addressed today have to do with the concept of licensing requirements engineers, which is not exactly the same as licensing software engineers. My views on these issues follow.
Airdisks and AirRAID: Modeling and scheduling periodic wireless data broadcast
Authors: R. Jain, J. Werth
Venue:  (1995)

We introduce a simple model, called the airdisk, for modeling the access of data transmitted periodically over wireless media as being analogous to the access of data from a standard magnetic disk. We consider several issues related to airdisks, such as their mean rotational latency under certain assumptions. The problem of scheduling the order in which data items are broadcast is analogous to that of determining how data should be laid out on the disk. Two problems of laying out data so as to minimize read time, given information about which data items are of most interest to the clients, are defined; both are shown to be NP-complete. We discuss ways in which the information about which items are of interest to clients can be obtained. Finally we consider how to increase the performance and storage capacity of airdisks, using the magnetic disk analogy as a guide. We suggest using multiple-track airdisks or borrowing the idea of Redundant Arrays of Inexpensive Disks (RAID) which is used for magnetic disks; for the wireless data broadcast environment we call the latter approach airRAID.
Discrete time process algebra and the semantics of SDL
Authors: Jan A. Bergstra, C. A. Middelburg, Yaroslav S. Usenko
Venue:  (1998)

We present an extension of discrete time process algebra with relative timing where recursion, propositional signals and conditions, a counting process creation operator, and the state operator are combined. Except the counting process creation operator, which subsumes the original process creation operator, these features have been developed earlier as largely separate extensions of time free process algebra. The change to the discrete time case and the combination of the features turn out to be far from trivial. We also propose a semantics for a simplified version of SDL, using this extension of discrete time process algebra to describe the meaning of the language constructs. This version covers all behavioural aspects of SDL, except for communication via delaying channels -- which can easily be modelled. The semantics presented here facilitates the generation of finitely branching transition systems for SDL specifications and thus it enables validation.
What is Design Quality? How can Quality in Electronic Design be Quantified?
Authors: Michael Reinhardt, Michael Santarini
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Quality of an IC design can be determined by many factors like Performance, Flexibility, Reliability, Testability, Ease of Maintenance, Yield, Portability, Reusability, etc. Quality of a design has to be considered on every level of a design from RTL description down to silicon. The chip design industry has come a long way since the days when quality considerations were an ad hoc combination of collective reactions to afterthoughts and back-end control gates used as a method of screening.Today, successful design efforts are measured by how fast they can meet aggressive design schedules. A key element in achieving aggressive design schedules in a meaningful way would be to develop designs that work the first time. Quality considerations in design were first introduced as part of the structured approach to VLSI design methodology more than a decade ago. Along with it came generic recommendations, rules and mandates that equally applied to all design practices with the goal of making the design process more predictable. All of this came at a price that included power, area and performance. Because of these drawbacks, the standard products industry (none-ASIC) continued to use ad hoc design methods instead of using a more streamlined and structured approach.Technology scaling into deep sub-micron and the growing design complexity has required many aspects of design flow and design methodology to become more design specific. Once known as bullet- proof methods in design have given way to more flexible implementation choices based on performance optimization goals and other necessary design tradeoffs. The sharp distinction that once existed between ASSP and ASIC designs has become somewhat blurred promising the difference will disappear altogether in a near future. Irrespective to their implementation methods, designs are expected to become increasingly more predictable and take less time to do. The bottom line for most design or semiconductor companies is how many engineering dollars need to be invested in a given design to create a maximum in revenue and more important in earnings.Therefore in the era of SOC design the quality of a design cannot only be determined whether the design meets the specification or not. The new quality criteria are related to the total costs a design creates during its entire lifetime. The longer a design stays alive or the more reincarnations it has in various silicon systems the more income a design can create. Factors like Reliability, Flexibility, Portability or Reusability are becoming more and more important for the success of a design. Experts from semiconductor companies, fabless design houses; EDA vendor and universities discuss what has to happen or what they do to ensure quality of their designs in an economic way.
Thermodynamic Properties of a q-Boson Gas Trapped in an n-Dimensional Harmonic Potential
Authors: Guozhen Su, Lixuan Chen, Jincan Chen
Venue: Open Systems Information Dynamics (2003)

The thermodynamic properties of an ideal q-boson gas trapped in an n-dimensional harmonic potential are studied, based on the distribution function of q-bosons. The critical temperature Tc,q of Bose-Einstein condensation (BEC) and the heat capacity C of the system are derived analytically. It is shown that for the q-boson gas trapped in a harmonic potential, BEC may occur in any dimension when q &ne; 1, the critical temperature is always higher than that of an ordinary Bose gas (q &equals; 1), and the heat capacity is continuous at Tc,q for a one-dimensional system but discontinuous at Tc,q for a two- or multi-dimensional system.
A High Performance Dynamic Token-Based Distributed Synchronization Algorithm
Authors: Alexander I-Chi Lai, Chin-Laung Lei
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper we propose a new dynamic token-based distributed synchronization algorithm that utilizes a new technique called optimistic broadcasting (optcasting) to improve efficiency. Briefly, an optcast message is a reliable unicast one that can also be heard by nodes other than its designated destination. Our algorithm manages pending token requesters by a distributed queue, and optcasts a direction towards the current queue end to help new requesters finding the queue end more quickly. Simulated experimental results indicate that our optcast algorithm outperforms the already fast Chang-Singhal-Liu (CSL) algorithm by up to 36%, especially for large systems of many processor nodes and under high synchronization loads. In addition, optcasting is highly robust and resistant to message loss, retaining at least 63% coverage even when the message loss rate approaches 100%.
A fuzzy data mining algorithm for finding sequential patterns
Authors: Yi-Chung Hu, Ruey-Shun Chen, Gwo-Hshiung Tzeng, Jia-Hourng Shieh
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

Since fuzzy knowledge representation can facilitate interaction between an expert system and its users, the effective construction of a fuzzy knowledge base is important. Fuzzy sequential patterns described by natural language are one type of fuzzy knowledge representation, and can thus be helpful in building a prototype fuzzy knowledge base. We define that a fuzzy sequence is an ordered list of frequent fuzzy grids, and the length of a fuzzy sequence is the number of frequent fuzzy grids in the frequent fuzzy sequence. Frequent fuzzy grids and frequent fuzzy sequences can be determined by comparing individual fuzzy supports with the user-specified minimum fuzzy support. A fuzzy sequential pattern is just a frequent fuzzy sequence, but it is not contained in any other frequent fuzzy sequence. In this paper, an effective algorithm called the Fuzzy Grids Bused Sequential Patterns Mining Algorithm (FGBSPMA) is proposed to generate fuzzy sequential patterns. A numerical example is used to show an analysis of the user visit to websites, demonstrating the usefulness of the proposed algorithm.
Visual Intelligence - Turning Data Into Knowledge
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Visual Intelligence is a process that provides information visualization technology to address the challenge of discovering and exploiting information. For innovative companies, Visual Intelligence applications are improving their decision-making capabilities by performing spatial and multivariate visual data analysis and providing rapid access to comprehensible information. This paper examines the issue faced by most business - how to turn data into understandable business knowledge, and make this knowledge accessible to persons who rely on it. The role of information visualization techniques and the Visual User Interface (VUI) in the overall Visual Intelligence process is assessed.The integration of Data Warehousing, Information Visualization, Web and new Visual Interaction techniques will change and expand the paradigms of current work of humans using computers. Visual Intelligence will improve visual communication that takes place in all elements of the user interface and provide decreased "time-to-enlightenment".
Dynamic scheduling of real-time messages over an optical network
Authors: Cheng-Chi Yu, S. Bhattacharya
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper proposes real-time traffic management algorithms over a multihop optical network. Our algorithms consider dynamic scheduling of (time, wavelength) slots in a multihop TWDM transmission schedule, so that a set of time-critical messages can meet their hard (and, soft) deadlines. Hard real-time messages are assigned to the highest priority level, while soft real-time messages are assigned to user-defined, progressively lower priority levels. The objective is to schedule these messages, all or as many as possible following the priority ordering. Previous research in this direction are either static scheduling policies (which cannot adapt to varying traffic conditions), or dynamic scheduling but for non-realtime traffic. Performance is measured in simulation. Where input factors include load, proximity of the deadline values, relative mix of hard and soft real-time messages, and priority levels of the messages.
Constructive Mathematics as a Programming Logic I: Some Principles of Theory
Authors: Robert L. Constable
Venue:  (1983)

The design of a programming system is guided by certain beliefs, principles, and practical constraints. These considerations are not always manifest from the rules defining the system. In this paper, the author discusses some of the principles which have guided the design of the programming logics built at Cornell in the last decade. Most of the necessarily brief discussion concerns type theory with stress on the concepts of function space and quotient types. Key Words and Phrases: automated logic, combinators, Edinburgh LCF, partial recursive functions, programming languages and logics, PL/CV, PRL, propositions-as-types, quotient types, strong intensionality, type theory.
Metrics for Controlling Effort During Adaptive Maintenance of Object Oriented Systems
Authors: F. Fioravanti, P. Nesi, F. Stortoni
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

The object-oriented modeling has been largely adopted in industry in the last years. Several systems built 4 or 5 years ago may need an adaptive maintenance process in order to better satisfy market and customer needs. In this paper 1 , a model for effort estimation/prediction of the adaptive maintenance is presented. A selection of metrics for effort estimation has been applied to the general model for evaluating maintenance effort. The metrics presented have been validated against real data. The validation presented has shown that some metrics that can be profitably employed for effort estimation/prediction can be also used with success for the estimation/prediction of the maintenance effort. Moreover, the results obtained gives some guidelines to maintain under control relevant factors for the adaptive maintenance.
Down Literal Circuit with Neuron-MOS Transistors and Its Applications
Authors: Jing Shen, Koichi Tanno, Okihiko Ishizuka
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

A voltage-mode neuron-MOS(?MOS) down literal circuit which realizes an arbitrary down literal function is proposed. It provides the benefit that the circuit can be easily fabricated by standard CMOS process, instead of the multi-level ion implantation applied in the conventional circuit. It has a variable threshold voltage by way of controlling only two bias voltages. Its noise margin and switching sensitivity are greater than those of variable-threshold C-?MOS inverter presented by Shibata. The threshold voltage errors of the circuit caused by device parameters mismatch is also analysed. Using the ?MOS down literal circuits, literal and Tgate circuits are also presented. Performances of the proposed circuits are evaluated using HSPICE simulations with MOSIS 2:0µm CMOS device parameters.
Generalized Markov Decision Processes: Dynamic-programming and Reinforcement-learning Algorithms
Authors: Csaba Szepesv\''ari, Michael L. Littman
Venue:  (1996)

The problem of maximizing the expected total discounted reward in a completely observable Markovian environment, i.e., a Markov decision process (MDP), models a particular class of sequential decision problems. Algorithms have been developed for making optimal decisions in MDPs given either an MDP specification or the opportunity to interact with the MDP over time. Recently, other sequential decision-making problems have been studied prompting the development of new algorithms and analyses. We describe a new generalized model that subsumes MDPs as well as many of the recent variations. We prove some basic results concerning this model and develop generalizations of value iteration, policy iteration, model-based reinforcement-learning, and Q-learning that can be used to make optimal decisions in the generalized model under various assumptions. Applications of the theory to particular models are described, including risk-averse MDPs, exploration-sensitive MDPs, sarsa, Q-learning with spreading, two-player games, and approximate max picking via sampling. Central to the results are the contraction property of the value operator and a stochastic-approximation theorem that reduces asynchronous convergence to synchronous convergence.
VORTEX GENERATION AND WAVE-VORTEX INTERACTION OVER A CONCAVE PLATE WITH ROUGHNESS AND SUCTION
Authors: Fabio Bertolotti
Venue:  (1993)

The generation and amplification of vortices by surface inhomogeneities, both in the form of surface waviness and of wall-normal velocity, is investigated using the nonlinear PSE equations. Transients and issues of algebraic growth are avoided through the use of a similarity solution as initial condition for the vortex. In the absence of curvature, the vortex decays as $ when flowing over streamwise aligned riblets of constant height, and grows as $ when flowing over a corresponding streamwise aligned variation of blowing/suction transpiration velocity. However, in the presence of wall inhomogeneities having both streamwise and spanswise periodicity, the growth of the vortex can be much larger. In the presence of curvature, the vortex develops into a "rtler vortex. The ``direct'''' and ``indirect'''' interaction mechanisms possible in wave-vortex interaction are presented. The ``direct'''' interaction does not lead to strong resonance with the flow conditions investigated. The ``indirect'''' interaction leads to K-type transition.
ReCoM: reinforcement clustering of multi-type interrelated data objects
Authors: Jidong Wang, Huajun Zeng, Zheng Chen, Hongjun Lu, Li Tao, Wei-Ying Ma
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is either not considered, or represented by a static feature space and treated in the same ways as other attributes of the objects. In this paper, we propose a novel clustering approach for clustering multi-type interrelated data objects, ReCoM (Reinforcement Clustering of Multi-type Interrelated data objects). Under this approach, relationships among data objects are used to improve the cluster quality of interrelated data objects through an iterative reinforcement clustering process. At the same time, the link structure derived from relationships of the interrelated data objects is used to differentiate the importance of objects and the learned importance is also used in the clustering process to further improve the clustering results. Experimental results show that the proposed approach not only effectively overcomes the problem of data sparseness caused by the high dimensional relationship space but also significantly improves the clustering accuracy.
Agent-oriented software engineering: a comparison of agent and non-agent version of a cluster server
Authors: Andraz Bezek, Matjaz Gams
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The agent-oriented software engineering research community is advocating the agent-based approach for the design of distributed systems. But currently, there is a substantial gap between the massive number of publications reporting advantages of agents, and the relatively small number of successful large applications. We present an agent-based cluster server application together with the analysis of advantages and disadvantages of the agent-based version compared to the non agent-based version of functionally similar cluster server application. Obtained experience is analyzed from the viewpoints of designers, developers and users. Observations confirm several previously published advantages of the agent-based approach and implementation; yet reveal some less familiar disadvantages as well. Overall, we argue that agent-based approach provide reasonable benefits already at this stage, while we lack further agent-based research.