ppxscal/embedding_network huggingface dataset:
A Language and Platform-Independent Approach for Reverse Engineering
Authors: Edward B. Duffy, Brian A. Malloy
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

In this paper, we present an approach for reverse engineering a program to capture design and implementation artifacts such as metrics and UML class or sequence diagrams. We also describe an implementation of our approach, libthorin. However, unlike previous reverse engineering tools, libthorin can be applied to a variety of programming languages including C, C++, Java, Fortran 90 and C#. Moreover, libthorin can provide both coarse-grained and fine-grained information about the program under development to enable re-engineering of information and high-level diagrams such as metrics and class diagrams, or low-level diagrams such as sequence diagrams, control flow graphs and other program representations and analysis tools for testing, debugging and profiling an application under development.
Closing-the-Loop in NVisionIP: Integrating Discovery and Search in Security Visualizations
Authors: Kiran Lakkaraju, Ratna Bearavolu, Adam Slagell, William Yurcik, Stephen North
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

The field of security visualization is in need of a paradigm shift in order to allow visualization tools to be practically used by security engineers. Security engineers must complete two different tasks, that of Discovery of a pattern, and that of Searching for a pattern in a data set. Current security visualizations do not aid the user in creating symbolic rules that represent visual patterns. Transforming visual patterns to symbolic rules requires effort by the security engineer and detracts from their main task of discovering interesting patterns. In this paper we describe the idea of Closing-The-Loop - a system where symbolic rules are created from visual patterns.
A Method Based on Continuous Spectrum Analysis and Artificial Immune Network Optimization Algorithm for Fingerprint Image Ridge Distance Estimation
Authors: Xiaosi Zhan, Yilong Yin, Zhaocai Sun, Yun Chen
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

It is important for improving the performance of automatic fingerprint identification system to estimate the ridge distance accurately. The traditional Fourier transform spectral analysis method had the worse redundancy degree in estimating the ridge distance because it was based on the two-dimension discrete Fourier spectrum. The statistical window method cannot obtain the accurate ridge distance because of the noises and the warp of the statistical value. The paper introduces the sampling theorem and artificial immune network into the fingerprint image ridge distance estimation method, transforms the discrete spectrum into the continuous spectrum, acquires the local peak points adopting the artificial immune network optimization algorithm and then obtains the ridge distance in the frequency field. The experimental results indicate that the ridge distance is more accurate and has improved the accuracy rate of automatic fingerprint identification system to a certain extent.
Dynamic scheduling to optimize utility functions of sojourn time moments in queueing systems
Authors: Yingdong Lu, Mark S. Squillante
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

It is well known that scheduling the service of customers according to the shortest remaining processing time (SRPT) policy is optimal with respect to minimizing the mean sojourn time of customers. Recent studies have further argued that SRPT does not unfairly penalize large customers in order to benefit small customers, and therefore these studies propose the use of SRPT to improve performance in various applications. However, as Schrage and Miller point out [10], the SRPT policy can raise several difficulties for a number of important reasons. Such difficulties can arise from the inability to accurately predict service times, or the complicated nature of implementing the preemptive aspect of the SRPT policy which requires keeping track of the remaining service times of all waiting customers as well as of the customer in service. Normally, preemption also incurs additional costs. and thus one might want to avoid the preemption of customers in service whose remaining service time is not much larger than that of a new arrival.
High Performance Computing in Science and Engineering
Authors: Peter W. Haas, Michael M. Resch
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

High performance computing has gradually shifted from the realm of research into development and partially even into the production cycles of industry. High performance computers therefore have to be integrated into production environments that demand the simultaneous solution of multidisciplinary physics problems. Supercomputer centers can learn from these new challenges imposed by industry. The concepts of work flow and production cycle open up a new horizon for integrating systems and software into what is called a distributed 'Teraflop-Workbench' approach. Terascale storage and communication infrastructures eventually will be needed to support such an environment.
Collaborative interactive physical simulation
Authors: Jérémie Dequidt, Laurent Grisoni, Christophe Chaillou
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

This article proposes a flexible solution for collaborative physical simulation. The proposed solution is resistant to low-performance networks. Unlike classical client/server models, it maintains the level of interaction of user in case of network shutdown. For such purpose, we use a loose-synchronized simulation framework that weakens (under some tolerance) the classical condition of synchronization for physical simulation. In the case of deterministic simulations, such simulation schemes ensures that all hosts asymptotically share the same, physically consistent, physical configuration. What is more, all hosts converge to this configuration in a smooth way.
A Web-based PLM System Research and Implementation in a Collaborative Product Development Environment
Authors: Hai-yue LI, Xiao LIU, Guo-en FENG, Cheng-en WANG
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

A conceptual PLM system architecture which contains a product modeling framework and an information infrastructure is proposed in this paper: The product modeling framework consists of a product information modeling architecture, a workjlow modeling architecture and the extended enterprise resource modeling architecture. A multidisciplinary collaborative design method based on the product modeling framework over Internet is discussed, and a J2EE standards based and multi-agents based information system infrastructure is presented in order to achieve the collaborative product development. Finalb, a PLM prototype system is implemented based on B/S scheme and the proposed conceptual PLM system architecture, and primary ideas have been validated.
HumanWalking Motion Synthesis Based on Multiple Regression Hidden Semi-Markov Model
Authors: Takashi Yamazaki, Naotake Niwase, Junichi Yamagishi, Takao Kobayashi
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

This paper describes a statistical approach for modeling and synthesizing human walking motion. In the approach, each motion primitive is modeled statistically from motion capture data using multiple regression hidden semi- Markov model (HSMM). HSMM is an extension of hidden Markov model (HMM), in which each state has an explicit state duration probability distribution, and multiple regression HSMM is the one whose mean parameter of probability distribution function is assumed to be given by a function of factors which affects human motion. In this paper, we introduce a training algorithm for the multiple regression HSMM, called factor adaptive training based on the EM algorithm and also describe a parameter generation algorithm from motion primitive HSMMs with prescribed values of factors. From experimental results, we show that the proposed technique can control walking movements in accordance with a change of the factors such as walking pace and stride length and can provide realistic human motion.
Effect of Preamplifier on Timing Recovery in Magnetic Recording Channels
Authors: Raman Venkataramani, M. Fatih Erden, Erozan Kurtas
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

We study the effect of the preamplifier cutoff frequency on the timing recovery performance of perpendicular magnetic recording systems with independent and identically distributed (IID) random input bits as well as run lengthlimited (RLL) encoded inputs. We observe that a larger cutoff frequency has a detrimental effect on the system performance. When using an RLL encoder with an IID input we observe a slight loss in performance. However, the true benefit of RLL codes is to prevent catastrophic failures for the worst-case inputs.
Can Fractal Dimension Be Used In Font Classification
Authors: S. Ben Moussa, A. Zahour, M. A. Alimi, A. Benabdelhafid
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this work, we present a new tool for the font optical recognition. This tool is based on the use of the fractal geometry. We used two techniques for obtaining two parameters, they allowed the extraction of the global textures characteristics. These characteristics are expressed in a parametric form. The vision aspect is held in consideration, since it makes it possible to differentiate one font of another. Experiments show the importance of the proposed approach.
Disaster Hardening for Software Systems
Authors: C. V. Ramamoorthy
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Software products neither grow old, nor fade away. They keep changing and improving (?) overtime. Generally, the design ideas, the patterns and the functions embodied in them are retained and reused frequently over long lengths of time. In this presentation, we explore some avenues of creating software systems, which can retain both the original functional and intellectual components with the objective of sustaining their use for a very long time. This implies they should be easily maintainable (e.g., by remote updating and maintenance through the Internet) or modifiable by users themselves. It is well known that maintenance accounts for largest fraction of the life-cycle cost in any software system. Of late, open systems environments and their development techniques have become very popular, particularly with the advent of the Linux operating system. Open systems ideas have been adopted by major software developers like Sun, and IBM, and by mobile communication product manufacturers. The most critical concern and issue with the open system products has been their maintenance. This is because the components of the software are developed and modified by several different designers who do not follow proper documentation and collaborative procedures and standards. The resulting system may be highly unstructured requiring further invasive modifications and thus creating more spirals of unstructuredness in their wake. There is no quality guaranty, and no one accepts responsibility for flaws. It is important that the open source/system software components must embody not only crucial application ideas and functions but also should support useroriented values such as ease of use; crash free operation and ease of maintenance (by the user, if possible) within the specified (wellunderstood) constraints. We consider a software malfunction as an instance of a disaster, however small or harmless it may be. Based on our previous studies on disaster engineering systems, we apply the ideas developed in preventing and mitigating disasters to design and develop all software systems, and more specifically for those intended for the open systems environment, because such systems are been unfortunately error-prone and unreliable. We show the commonality and transferability of several methods and approaches that can be carried over effectively between disaster engineering and software engineering.
Camera based Degraded Text Recognition Using Grayscale Feature
Authors: Jun Sun, Yoshinobu Hotta, Yutaka Katsuyama, Satoshi Naoi
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

As the rapid progress of digital imaging technology, camera based character recognition receives more and more attentions. One challenge in camera based OCR is the recognition for degraded text. Conventional OCR engines usually recognize on binary image. However, the performance drops dramatically as the degradation level increases. In this paper, a new recognition method is proposed to recognize degraded character based on dual eigenspace decomposition and synthetic degraded data. Then, the degraded character string is segmented by the combination of binary and grayscale analysis. Experiments on single character and text string recognition prove the effectiveness of our method.
Learning classifier system ensemble for data mining
Authors: Yang Gao, Joshua Zhexue Huang, Hongqiang Rong, Daqian Gu
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This paper proposes LCSE, a learning classifier system ensemble, which is an extension of the classical learning classifier system(LCS). The classical LCS includes two major modules, a genetic algorithm module used to facilitate rule discovery, and a reinforcement learning module used to adjust the strength of the corresponding rules while it receives the rewards from the environment. In LCSE we build a two-level ensemble architecture to enhance the generalization of LCS. In the first-level, new instances are first bootstrapped and sent to several LCSs for classification. Then, in the second-level, a plurality-vote method is used to combine the classification results of individual LCSs into a final decision. Experiments on some benchmark data sets from the UCI repository have shown that LCSE has better generalization ability than the single LCS and other supervised learning methods.
Real-Time Solution in Petroleum Industry"s Cyber Data Acquisition Simulation System
Authors: Wei Li, Lei Wang
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Petroleum industry¿s Cyber data acquisition simulation system is developed to provide a virtual machine for reserving the valuable equipments and geological reconnaissance system software which had run on real Cyber data acquisition system that has been out of date. The aim of this paper is to discuss real-time issues involved in the design of the data acquisition simulation system. The hardware architecture of the real Cyber data acquisition system is discussed first. Secondly this paper describes the configuration and software architecture of the Cyber data acquisition simulation system. Then we will give a real-time solution based on the performance constraint of the simulation system. Then we select real-time operating system ¿ RTLinux as software platform, and design a layer architecture of simulation system based on RTLinux. At last, we evaluate the key real-time performance parameters of the simulation system and draw a conclusion.
UPX: A New XML Representation for Annotated Datasets of Online Handwriting Data
Authors: Mudit Agrawal, Kalika Bali, Sriganesh Madhvanath, Louis Vuurpijl
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper introduces our efforts to create UPX, an XML-based successor to the venerable UNIPEN format for the representation of annotated datasets of online handwriting data. In the first part of the paper, shortcomings of the UNIPEN format are discussed and the goals of UPX are outlined. Prior work related to UPX in the form of the recently proposed hwDataset representation is presented. The second part of the paper summarizes the status of the UPX effort, in particular, experiments to map UNIPEN elements to hwDataset and InkML and identify potential issues with migrating existing UNIPEN data to UPX. This is work in progress, and we invite participation from the handwriting recognition research community and industry to make UPX a reality.
The next 700 data description languages
Authors: Kathleen Fisher, Yitzhak Mandelbaum, David Walker
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, which include pads, datascript, and packettypes, are designed to facilitate programming with ad hoc data, ie, data not in well-behaved relational or xml formats. In the calculus, each type describes the physical layout and semantic properties of a data source. In the semantics, we interpret types simultaneously as the in-memory representation of the data described and as parsers for the data source. The parsing functions are robust, automatically detecting and recording errors in the data stream without halting parsing. We show the parsers are type-correct, returning data whose type matches the simple-type interpretation of the specification. We also prove the parsers are "error-correct," accurately reporting the number of physical and semantic errors that occur in the returned data. We use the calculus to describe the features of various data description languages, and we discuss how we have used the calculus to improve PADS.
Channel Smoothing: Efficient Robust Smoothing of Low-Level Signal Features
Authors: Michael Felsberg Per-Erik Forssen Hanno Scharr
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, we present a new and efficient method to implement robust smoothing of low-level signal features: B-spline channel smoothing. This method consists of three steps: encoding of the signal features into channels, averaging of the channels, and decoding of the channels. We show that linear smoothing of channels is equivalent to robust smoothing of the signal features if we make use of quadratic B-splines to generate the channels. The linear decoding from B-spline channels allows the derivation of a robust error norm, which is very similar to Tukey's biweight error norm. We compare channel smoothing with three other robust smoothing techniques: nonlinear diffusion, bilateral filtering, and mean-shift filtering, both theoretically and on a 2D orientation-data smoothing task. Channel smoothing is found to be superior in four respects: It has a lower computational complexity, it is easy to implement, it chooses the global minimum error instead of the nearest local minimum, and it can also be used on nonlinear spaces, such as orientation space.
UML formalization is a traceability problem
Authors: R. E. K. Stirewalt, Min Deng, Betty H. C. Cheng
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

Largely driven by the widespread interest in using UML, significant efforts have investigated how to formalize its semantics in terms of well-defined target languages. Associating target language specifications with the UML models enables automated analysis of its many graphical diagrams. Unfortunately, UML formalizations have proved difficult to completely automate. This paper posits that UML formalization is essentially a traceability problem, which means to rigorously link elements of a given UML diagram to relevant regions of code in a given target model according to the intended formalization semantics. We present a graph-theoretic model for formally defining this link-retrieval problem. We also introduce a framework for assessing whether a UML formalization is amenable to efficient link retrieval techniques without sacrificing precision and/or recall.
Agent-based simulation of ecological alcohol systems
Authors: Yasmin Hassan Said
Venue:  (2005)

This is research is to establish a modeling framework for alcohol abuse that allows evaluation of interventions meant to reduce adverse effects of alcohol overuse without the financial, social and other costs of imposing interventions that are ultimately ineffective (or even simply not cost effective). The framework is ecological {individual agents and their activities are represented), stochastic (neither individual behavior nor consequences of interventions are certain) and flexible. Constructing the framework involves interactions among the domain science of alcohol studies, statistics, and computer science.* In the developed world such as the United States, based on Disability Adjusted Life Years (DALY) lost (Ezzati et al., 2002), alcohol is the third leading cause of mortality and morbidity. Much of the mortality and morbidity is associated with violence as a result of drinking behavior. Interventions designed to reduce both chronic and acute mortality and morbidity associated with alcohol use may be effective in limited circumstances. However, often suppressing one negative outcome can have the impact of increasing other negative outcomes. For example, adding police patrols to drinking hotspots may suppress assaults, but may increase driving under the influence and domestic violence. This research initiates a systemic approach to understanding the complex interactions and consequently exploring the effect of interventions within sectors of the complex ecological-like system that surrounds users and abusers of alcohol. The tool that I have developed effectively allows the investigator to play the &ldquo;what if&rdquo; games to find improved strategies and subsequently design intervention strategies toward accomplishing the desired reductions in negative outcomes. Such a strategy is particularly relevant to both the entire society and subsegments of it, e.g. the military because of the potential for alcohol abuse among young, unattached males and the resulting loss of military readiness, order and warfare capabilities (Dunham, 2004). The leap from genomic, microbiologic and neuronal understanding of the effects of alcohol to the behavior of individuals as influenced by alcohol is one that has not been thoroughly understood in the medical and psychological literature. I believe that an ecological approach leads to a better understanding of the alcohol behavior on a macro-scale and allows insight into the linkage between the neuronal scale and the behavioral scale with a direct impact on treatment strategies. (Abstract shortened by UMI.) *Please refer to dissertation for diagrams.