ppxscal/embedding_network huggingface dataset:
An Alternative Object Oriented Reengineering for Thin-Client Environments
Authors: Valter Vieira de Camargo, Rosângela Ap. D. Penteado
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

This paper shows an object-oriented reengineeringprocess of procedural legacy systems for Web-basedenvironments. Thus, the architecture of these systemsshould be restructured for the client/server model. It canbe made by separating the application logic and databasecomponents, which are executed in the server, from a userinterface component, which is executed at the client. Amiddleware should be defined to be responsible forcommunication between these components. Thereengineering proposed here uses the Fusion/RE methodfor the reverse engineering process. This method wasspecialized for COBOL language domain and guidelinesare presented to generate an object oriented analysismodel specified in UML. HTML language is used for theimplementation of system's new interfaces and theservlets, an API of Java language for the middleware.Persistence Layer design pattern is used to separate theapplication logic component from database component.These guidelines had been implemented in FAROOL tool,but this will not be focused in this paper
On the emergence of highly variable distributions in the autonomous system topology
Authors: Marwan Fayed, Paul Krapivsky, John W. Byers, Mark Crovella, David Finkel, Sid Redner
Venue: ACM SIGCOMM Computer Communication Review (2003)

Recent studies observe that vertex degree in the autonomous systems (AS) graph exhibits a highly variable distribution [14, 21]. The most prominent explanatory model for this phenomenon is the Barabasi-Albert (B-A) model [5, 2]. A central feature of the B-A model is preferential connectivity --- meaning that the likelihood a new node in a growing graph will connect to an existing node is proportional to the existing node's degree. In this paper we ask whether a more general explanation than the B-A model, and absent the assumption of preferential connectivity, is consistent with empirical data. We are motivated by two observations: first, AS degree and AS size are highly correlated [10]; and second, highly variable AS size can arise simply through exponential growth. We construct a model incorporating exponential growth in the size of the Internet and in the number of ASes, and show that it yields a size distribution exhibiting a power-law tail. In such a model, if an AS's link formation is roughly proportional to its size, then AS out-degree will also show high variability. Moreover, our approach is more flexible than previous work, since the choice of which AS to connect to does not impact high variability, thus can be freely specified. We instantiate such a model with empirically derived estimates of historical growth rates and show that the resulting degree distribution is in good agreement with that of real AS graphs.
Towards the systematic use of interfaces in JAVA programming
Authors: Friedrich Steimann, Wolf Siberski, Thomas Kühne
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

JAVA's interface construct is widely perceived as a weak surrogate for multiple inheritance. Consequently, it should come as no surprise that despite their potential for writing highly decoupled code, interfaces are used rather sparingly. We have devised a conceptual framework for the utilization of interfaces in JAVA programs, and suggest tool support lessening the coding effort induced by the introduction and maintenance of additional interfaces, as well as a metrics suit measuring how and to which extent interfaces are actually used.
Development of an Instrument to Measure the Acceptance of Internet Technology by Consumers
Authors: Christina Gardner, Donald L. Amoroso
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

This research reviews studies using the Technology Acceptance Model (TAM0 in order to create a modified model and instrument to study the acceptance of Internet technology by consumers. In this paper, we examined the relationships between the TAM constructs in some of the research that purports to explain the variance in the acceptance of different information technologies. Based upon the empirical research using the technology assessment model, a modified TAM was developed for the acceptance of Internet-based technologies by consumers. The original constructs (beliefs, attitudes, behavior and use) were retained from the TAM while the literature suggests gender, experience, complexity, and voluntariness to be useful antecedents for predicting perceived usefulness, perceived ease of use and behavioral intent to use. Hypotheses were discussed in this study related to the theoretical relationships between constructs and antecedents. A survey instrument was developed using existing scales from prior TAM instruments and modifying them where appropriate. The resultant instrument can be used in future research to test how consumers adopt and accept Internet-based applications.
Rotor transverse crack detection and diagnosis using embedded modeling
Authors: C. James Li
Venue:  (2003)

Early detection, diagnosis, and even prognosis of a crack in the shaft of a rotor system has been a field of challenging ongoing research for the safe and economic operation of the machinery containing them. This study proposes an embedded modeling methodology for identifying the local stiffness of the shaft in a rotor system from the lateral vibrations in the horizontal and vertical directions. An embedded model integrating a dynamic model of the rotor system and the unknown local stiffness in the form of a neural network is established. A solution method is then used to find the stiffness of the shaft that minimizes the discrepancy between the model output and the measured output. Subsequently, a method is then used to find the location and size of the crack along the shaft using a crack model. Simulated studies were conducted to evaluate if the stiffness of the shaft of a Jeffcott rotor system can be estimated, and to determine if the location can be uniquely identified.
GigaOp DSP on FPGA
Authors: Brad L. Hutchings, Brent E. Nelson
Venue: Journal of VLSI Signal Processing Systems (2004)

DSP algorithms such as automated target recognition and SONAR beamforming are a good match for FPGA technology due to their regular structure, available parallelism, pipeline-ability, and modest data word sizes. FPGA implementations of these applications outperformed their DSP and microprocessor counterparts by factors ranging from 10&times; on up with an equivalent sustained computational rate of more than 2 GOps/second per FPGA. This paper introduces a set of criteria which have a great impact on how well an application maps to FPGA technology. It then describes two applications in detail and the process of mapping each to FPGA technology. Comparisons with software implementations are made and followed by conclusions and future challenges.
J2EE Design Patterns
Authors: William Crawford, Jonathan Kaplan
Venue:  (2003)

Crawford and Kaplan's J2EE Design Patterns approaches the subject in a unique, highly practical and pragmatic way. Rather than simply present another catalog of design patterns, the authors broaden the scope by discussing ways to choose design patterns when building an enterprise application from scratch, looking closely at the real world tradeoffs that Java developers must weigh when architecting their applications. Then they go on to show how to apply the patterns when writing realworld software. They also extend design patterns into areas not covered in other books, presenting original patterns for data modeling, transaction / process modeling, and interoperability.
A Comparative Study of Techniques for Intrusion Detection
Authors: Srinivas Mukkamala, Andrew H. Sung
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Due to increasing incidents of cyber attacks and heightened concerns for cyber terrorism, implementing effective intrusion detection systems (IDSs) is an essential task for protecting cyber security--as well as physical security because of the great dependence on networkedcomputers for the operational control of various infrastructures.Building effective IDSs, unfortunately, has remained an elusive goal owing to the great technical challenges involved; and applied AI techniques are increasingly being utilized in attempts to overcome the difficulties. This paper presents a comparative study of using support vector machines (SVMs), artificial neural networks (ANNs), multivariate adaptive regression splines (MARS) and linear genetic programs (LGPs) for intrusion detection. We investigate and compare the performance of IDSs based on the mentioned techniques, with respect to a well-known set of intrusion evaluation data gathered by Lincoln Labs.Through a variety of experiments and analysis, it is found that, with appropriately chosen population size, program size, crossover rate and mutation rate, LGPs outperform other techniques in terms of detection accuracy at the expense of time. SVMs outperform MARSand ANNs in three critical aspects of intrusion detection: accuracy, training time, and testing time.
Fullerite C60 as electron-beam resist for 'dry' nanolithography
Authors: V. V. Shnitov, V. M. Mikoushkin, Yu. S. Gordeev
Venue: Microelectronic Engineering (2003)

The fullerite C60 modification induced by electron irradiation was studied using electron energy loss spectroscopy (EELS). We show that prolonged electron irradiation causes gradual transformation of electron and atomic structures of fullerite C60 films towards respective structures of amorphous carbon. Moreover, strongly modified parts of fullerite C60 films become thermally unevaporable. A possible mechanism of these effects is suggested. Finally, we propose a new original nanolithography technique based on two key ideas: the use of fullerite films as negative electron-beam resist and development of lithographic images by appropriate thermal treatment of these films.
Verification of System Models for Steady-State and Dynamic Security Assessment
Authors: Alexander Apostolov
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The requirements for improvement in the stability of electric power systems and reduction in the effect of abnormal system conditions on sensitive customers can be met only by better understanding of the behavior of the system and optimized configuration of the differentprotection and control systems.The planning, design and implementation of such systems are based on the use of advanced analysis tools. They model the primary and secondary components of electric power systems and analyze its operation under normal or abnormal conditions.The accuracy of the different simulations and the assessment of steady-state and dynamic security is determined to a great extent by the accuracy of the models. The paper describes different types of system security related analysis tools:Short CircuitProtection CoordinationDynamic StabilityThe models of power system equipment and the requirements for verification of these models in the different types of software are discussed later in the paper. Recording of system parameters during abnormal system conditions and comparison with the results from steady-state or dynamic stability simulations of the same event based on the model system allows the verification of the system models and building confidence in the assessment of possible system disturbances. The recording capabilities of multifunctional intelligent electronic devices (IEDs) are described and different recording modes are identified and proposed for the verification of system models.The architecture of a distributed system for recording of local or wide area system disturbances is presented. Requirements and methods for time synchronization of multifunctional IED located throughout the system are discussed.
Enabling mobile agents to dynamically assume roles
Authors: Giacomo Cabri, Luca Ferrari, Letizia Leonardi
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Agent-based application development must face the issues related to the interactions among agents. In fact, their sociality allows decomposing large applications into collaborating agents, while open environments, such as the Internet, require agents belonging to different applications to compete to gain resources. In the BRAIN framework, interactions among agents are fruitfully modeled and implemented on the basis of roles. This approach achieves several advantages, from separation of concerns between the algorithmic issues and the interaction issues, to the reuse of solutions and experiences in different applications. In this paper we propose a mechanism to enable Java agents to dynamically assume roles at runtime. Our approach is based on the modification of the bytecode of Java agents, in order to implement an appropriate interface and to add the related methods. An application example and the comparison with other approaches show the effectiveness of our approach.
Descent Functions and Random Young Tableaux
Authors: Ron M. Adin, Yuval Roichman
Venue: Combinatorics, Probability and Computing (2001)

The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines probabilistic arguments together with combinatorial character theory. Connections with Hecke algebras are mentioned.
Considering the IS-Business Relationship: A Measurement Approach
Authors: Jay G. Cooprider
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

To better understand the relationships between IS organizations and their associated client business (line) organizations, we build and test a theoretical model of the management of these relationships. This model originates in the political economy framework of organizational analysis, and couples two streams of theories: transaction cost analysis and resource dependency analysis. Additionally, elements of social contract theory are used to emphasize the long-term, relational aspect of the IS-line relationship. From these frameworks, two dimensions of the IS-business relationship are proposed: Sustainability and Influence. These constructs are conceptualized separately for each participant, emphasizing the disparate perspectives held by IS and the line. The model is validated with a field study of 121 IS-linerelationships, in which the reliability and validity of the model is established in a confirmatory factor analytic approach.
No zero match browsing of hierarchically categorized information entities
Authors: Chris McMahon, Rose Crossland, Alistair Lowe, Tulan Shah, Jon Sims Williams, Steve Culley
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

The two main ways to search for information in electronic document collections are by using free-text retrieval search engines or browsing information that has been organized into predefined organizational structures. However, each of these approaches has limitations. Using word or phrase search, users are faced with a compromise between overly broad searches returning an excessive amount of information or overly narrow searches that may fail to return relevant information. Browsing organizational structures is dependent on the user's knowledge of the structures, and a user may find it difficult to refine searches. This paper introduces a user interface based approach to the browsing of hierarchically organized information entities that avoids these problems by allowing the incremental narrowing down of a set of search results and by pruning the organizational structure after each user selection to show the consequences of the selection. The effect is to present to the user at all times only that part of the organizational structure that will lead to a nonnull selection. The approach is called no zero match (NZM) browsing. The paper presents the computational basis of NZM browsing before describing a trial implementation of the approach and presenting three case studies, which represent common search situations in an engineering context.
Monitoring of Timing Constraints with Confidence Threshold Requirements
Authors: Chan-Gun Lee, Aloysius K. Mok, Prabhudev Konana
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

We propose an algorithm for monitoring timing constraintsto satisfy confidence threshold requirements whenthere is uncertainty in the exact timing of event occurrences.In our model, a timed event trace is examined for possiblesatisfaction/violation with respect to a given set of timingconstraints.Every event occurence has a timestamp givenby a time interval.Assuming that the time of occurence isuniformly distributed over the time interval, our algorithmdetermines whether the probability that a timing constrainthas been satisfied exceeds a specified threshold value.Timingconstraints are composed of deadline and delay constraintsfor which satisfaction probabilities are defined.Aconfidence threshold is a minimum satisfaction probabilityof the timing constraint.A timing constraint is violated if theconfidence threshold is not reached by the timed event trace.We present a PTime monitoring algorithm for detecting timingviolation by finding the earliest expiration time (EET)of the deadline timer for each of the cases P = 100%,50% ¿ P
Periodic Resource Model for Compositional Real-Time Guarantees
Authors: Insik Shin, Insup Lee
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

We address the problem of providing compositional hardreal-time guarantees in a hierarchy of schedulers. We firstpropose a resource model to characterize a periodic resourceallocation and present exact schedulability conditionsfor our proposed resource model under the EDF andRM algorithms. Using the exact schedulability conditions,we then provide methods to abstract the timing requirementsthat a set of periodic tasks demands under the EDF and RMalgorithms as a single periodic task. With these abstractionmethods, for a hierarchy of schedulers, we introduce acomposition method that derives the timing requirements ofa parent scheduler from the timing requirements of its childschedulers in a compositional manner such that the timingrequirement of the parent scheduler is satisfied, if and onlyif, the timing requirements of its child schedulers are satisfied.
A taxonomy for object-relational queries
Authors: David Taniar, Johanna Wenny Rahayu, Prakash Gaurav Srivastava
Venue: Effective databases for text & document management (2003)

A comprehensive study of object-relational queries gives not only an understanding of full capability of object-relational query language but also a direction for query processing and optimization. This chapter classifies object-relational queries into REF queries, aggregate queries and inheritance queries. REF queries are queries involving REF pointers, whereas aggregation queries use either nested table structures or index on clusters. Finally, inheritance queries are queries on inheritance hierarchies.
On the influence of GVR in vehicle routing
Authors: Jorge Tavares, Penousal Machado, Francisco B. Pereira, Ernesto Costa
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

A comparative study is made between a new evolutionary approach for the Vehicle Routing Problem (VRP) and a standard evolutionary model, based on Path Representation. Genetic Vehicle Representation (GVR) is the new two-level representational scheme designed to deal in an effective way with all the information needed by candidate solutions. Experimental results, obtained from a set of VRP instances, show performance improvements when GVR is used.
Concept-controlled polymorphism
Authors: Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

Concepts--sets of abstractions related by common requirements-- have a central role in generic programming. This paper proposes a general framework for using concepts to control polymorphism in different ways. First, concepts can be used to constrain parametric polymorphism, as exemplified by type classes in Haskell. Second, concepts can be used to provide fine-grained control of function and operator overloading. Finally, generic functions can be overloaded (specialized) based on concepts, rather than simply on types. We describe a C++ implementation of a new mechanism, which we call <b><i>enable_if</i></b>, and its role in concept-controlled polymorphism.
Repeatable and realistic wireless experimentation through physical emulation
Authors: Glenn Judd, Peter Steenkiste
Venue: ACM SIGCOMM Computer Communication Review (2004)

In wireless networking research, there has long existed a fundamental tension between experimental realism on one hand, and control and repeatability on the other hand. Hardware-based experimentation provides realism, but is tightly coupled to the physical environment and circumstances under which experiments are carried out. To overcome this, researchers have understandably embraced simulation as a means of evaluation. Unfortunately, wireless simulation is plagued with inherent inaccuracies. To overcome the stark tradeoff between the realism of hardware-based experimentation and the repeatability of simulation-based experimentation, we are developing a wireless emulator that enables both realistic and repeatable experimentation. Unlike previous emulators, our approach simultaneously achieves both a high degree of realism and fine-grained repeatability by leveraging physical layer emulation.
Performance, energy, and reliability tradeoffs in replicating hot cache lines
Authors: W. Zhang, M. Kandemir, A. Sivasubramaniam, M. J. Irwin
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

The importance of L1 data caches makes their performance, power consumption, and data integrity characteristics extremely critical in embedded systems design. We examine these issues in the context of a mechanism that tries to enhance data cache reliability by replicating cache lines (blocks) in active use. When replicating data cache lines, it is important to not evict other lines that may be needed or to not incur very high power consumption. We evaluate the tradeoffs between these three goals (reliability, energy, and performance) by modulating two important parameters, namely, the hot-block threshold and the dead-block threshold. We show that having a hot-block threshold in the range of 10-1000 cycles can provide good reliability characteristics, without compromising on performance or power. At the same time, our results indicate that one could use aggressive dead-block thresholds to provide leakage power savings without compromising on the performance and reliability characteristics. The results from this paper can be used to design power, performance, and reliability enhanced cache architectures.