ppxscal/embedding_network huggingface dataset:
Taxonomy of Java Web Application Frameworks
Authors: Tony C. Shan, Winnie W. Hua
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper describes various web application frameworks and related emerging technologies pertinent to the Java EE model from a technical perspective. A definition of "web application framework" is specified, as this terminology has been widely used and implies drastically different meanings in different contexts. The value proposition of a web application framework is presented to illustrate how a framework can improve the application development productivity and quality. The design philosophy of web application frameworks is articulated. A comprehensive taxonomic scheme is defined to classify various software frameworks and web application frameworks into appropriate categories. Among dozens of web application frameworks available as commercial and open source solutions, the predominant products are investigated, followed by the selection guidelines and recommendations. A reference card is constructed to summarize the key aspects of web application frameworks. Relevant technologies and future trends are also discussed.
Capacity allocation with competitive retailers
Authors: Masabumi Furuhata, Dongmo Zhang
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

This paper addresses a problem in supply chain management that how scarce resources can be efficiently allocated among competing interests. We present a formal model of allocation mechanisms for such settings that a supplier with limited production capacity allocates its products to a set of competitive retailers. In contrary to the existing allocation mechanisms in which retailers are local monopolists, the new model exhibits much more complicated market behaviors. We show that the widely-used proportional allocation mechanism is no longer necessarily Pareto optimal, even if all retailers are in a symmetric situation. A necessary and sufficient condition for the proportional allocation to be Pareto optimal is given. We propose a truth-inducing allocation mechanism based on our capacity allocation model, which is more intuitive and applicable than the existing truth-inducing mechanisms.
An empirical study of developers views on software reuse in statoil ASA
Authors: Odd Petter N. Slyngstad, Anita Gupta, Reidar Conradi, Parastoo Mohagheghi, Harald Rønneberg, Einar Landre
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

In this article, we describe the results from our survey in the ITdepartment of a large Oil and Gas company in Norway (Statoil ASA), in order to characterize developers' views on software reuse. We have used a survey followed by semi-structured interviews, investigating software reuse in relation to requirements (re)negotiation, value of component information repository, component understanding and quality attribute specifications. All 16 developers participated in the survey and filled in the questionnaire based on their experience and views on software reuse. Our study focuses on components built and reused in-house. The results show that reuse benefits from the developers view include lower costs, shorter development time, higher quality of the reusable components and a standardized architecture. Component information repositories can contribute to successful software reuse However, we found no relation between reuse and increased rework. Component understanding was generally sufficient, but documentation could be improved. A key point here is dynamic and interactive documents. Finally, quality attribute specifications were trusted for the applications using reusable components in new development, but not for the reusable components themselves.
Image segmentation by histogram thresholding using hierarchical cluster analysis
Authors: Agus Zainal Arifin, Akira Asano
Venue: Pattern Recognition Letters (2006)

This paper proposes a new method of image thresholding by using cluster organization from the histogram of an image. A new similarity measure proposed is based on inter-class variance of the clusters to be merged and the intra-class variance of the new merged cluster. Experiments on practical images illustrate the effectiveness of the new method.
LDPC codes generated by conics in the classical projective plane
Authors: Sean V. Droms, Keith E. Mellinger, Chris Meyer
Venue: Designs, Codes and Cryptography (2006)

We construct various classes of low-density parity-check codes using point-line incidence structures in the classical projective plane PG(2,q). Each incidence structure is based on the various classes of points and lines created by the geometry of a conic in the plane. For each class, we prove various properties about dimension and minimum distance. Some arguments involve the geometry of two conics in the plane. As a result, we prove, under mild conditions, the existence of two conics, one entirely internal or external to the other. We conclude with some simulation data to exhibit the effectiveness of our codes.
Software Licensing Models: What's Out There?
Authors: Daniel Ferrante
Venue: IT Professional (2006)

As software and hardware evolve, licensing choices are becoming more complex. Understanding licensing trends and the latest models is one way to achieve the greatest return on software investment.
Web Search Engines: Part 1
Authors: David Hawking
Venue: Computer (2006)

A behind-the-scenes look explores the data processing "miracle" that characterizes Web crawling and searching.
TIDES - Using Bayesian Networks for Student Modeling
Authors: Abderrahim Danine, Bernard Lefebvre, Andre Mayers
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

We present in this paper an intelligent tutoring system using a Bayesian network. This tutor is dedicated to the analysis and diagnosis of student's errors. The elaboration of such a system necessitates nearly always taking into consideration information that is potentially incomplete or uncertain. Indeed, in a learning situation, we can neither know exactly the student's plan nor his goal. In addition, we cannot observe what the student knows or does not know, but we can only make imperfect estimations through his actions. In order to model the student in this situation, we designed and implemented an intelligent system that uses Bayesian networh.
Introduction and Implementation of a System to Share Findings with ROI for PET Diagnosis Support
Authors: Kazunori SUNAKO, Tetsuya ISHIE, Masaru UEDA, Takashi TOMII
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Positron Emission Tomography (PET) is an effective imaging technique to detect cancers, but interpretation of PET images is difficult for radiologists who have insufficient knowledge and experience. Radiologists could interpret PET images more effectively if they were able to share their PET expertise. To realize this goal, our recent efforts have designed a PET information model that represents the process of interpreting PET images; we have implemented the Whole-Body PET Database (WB-PET DB). The PET information model defines the WB-PET DB schema. WB-PET DB stores findings along with a region of interest (ROI), thereby allowing ROI image retrieval by keys that radiologists use when writing findings. Regarding WB-PET DB, we have shown its conceptual model in recent works, but have revealed little about its system architecture. In this study, we designed and implemented the WB-PET DB System. This system contains the user interface to insert ROI into WB-PET DB and the component that outputs results of retrieval. This component outputs them in a DICOM file format; thereby users can view stored ROIs using 3D visualization software such as AmiraTM. Results of this study demonstrated a model to retrieve an image of body functionality as a PET image.
Analysis of a short-circuit ring impact problem and design of a new ventilator for a 625 kVA generator, using SVL
Authors: José L. Oslinger, Jairo A. Palacios, Guillermo A. Jaramillo
Venue: Mathematics and Computers in Simulation (2006)

The necessity of an energy supplier was to solve an impact problem presented at the damper winding ring or short-circuit ring of a 625 kVA generator and to redesign a fan for it. The principal restriction was the time. It should be done in 15 calendar days, working with drawings of the machine, operational data and from specifications, taking measures from the real machine during just one day while the machine's maintenance began in order to solve the impact problem which real cause was not found yet. The answer was found working with the concept of simplified virtual laboratory (SVL) using finite elements analysis (FEA) and failure analysis from visual inspection. A fast and effective method which combines simplified 2D computational fluid dynamics (CFD) Models and analytical formulation from electrical machines bibliography allowing time and money saving is shown.
Fire-and-Forget: Load/Store Scheduling with No Store Queue at All
Authors: Samantika Subramaniam, Gabriel H. Loh
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Modern processors use CAM-based load and store queues (LQ/SQ) to support out-of-order memory scheduling and store-to-load forwarding. However, the LQ and SQ scale poorly for the sizes required for large-window, high- ILP processors. Past research has proposed ways to make the SQ more scalable by reorganizing the CAMs or using non-associative structures. In particular, the Store Queue Index Prediction (SQIP) approach allows for load instructions to predict the exact SQ index of a sourcing store and access the SQ in a much simpler and more scalable RAMbased fashion. The reason why SQIP works is that loads that receive data directly from stores will usually receive the data from the same store each time. In our work, we take a slightly different view on the underlying observation used by SQIP: a store that forwards data to a load usually forwards to the same load each time. This subtle change in perspective leads to our "Fire-and- Forget" (FnF) scheme for load/store scheduling and forwarding that results in the complete elimination of the store queue. The idea is that stores issue out of the reservation stations like regular instructions, and any store that forwards data to a load will use a predicted LQ index to directly write the value to the LQ entry without any associative logic. Any mispredictions/misforwardings are detected by a low-overhead pre-commit re-execution mechanism. Our original goal for FnF was to design a more scalable memory scheduling microarchitecture than the previously proposed approaches without degrading performance. The relative infrequency of store-to-load forwarding, accurate LQ index prediction, and speculative cloaking actually combine to enable FnF to slightly out-perform the competition. Specifically, our simulation results show that our SQless Fire-and-Forget provides a 3.3% speedup over a processor using a conventional fully-associative SQ.
VT: a virtual terminal window package for UNIX
Authors: Robert Gammill, Prithvi Ram
Venue: ACM SIGSMALL Newsletter (1984)

A window package called VT has been developed for UNIX version 6 and the Heath H19 terminal. The package is written in C and is implemented entirely at the user level. Only a nonstandard system call named port is required. VT enables the user to act as if he is commanding several terminals while using a single CRT terminal. The user can make rectangular windows, each with a shell (UNIX command interpreter), and concurrently run commands in each window. All input and output for each shell is confined to its own window, so each window serves as a virtual terminal. Implementation under Version 7 and later releases of UNIX is planned.
Four and twenty tern chicks plotted in a pie: a graphical interface for predicting chick ages with a confidence estimate
Authors: Paul Lyons, Geoffrey Jones
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

We present a computer interface that represents the age of chicks as dynamically-generated chromatic bands on a set of plots drawn on conventional Cartesian axes. The chromatic information allows us to increase the number of variables on the plot from two to three, so that the user can infer a chick's age from two easily obtained body measurements. The overall image contains a number of realisations of a non-linear multivariate hierarchical model of chick growth; the model is parametric, and each plot is produced by running the model with a different combination of parameters. Even with chromatic banding, the plots can be difficult to interpret because, when many plots overlap, later plots obscure earlier ones. To reveal the information hidden thereby, the interface incorporates a component that allows the user to generate a pie-chart showing all the ages that fall within a 95% confidence ellipse around any point on the plot.
An Integrated Model of Top-Down and Bottom-Up Attention for Optimizing Detection Speed
Authors: Vidhya Navalpakkam, Laurent Itti
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Integration of goal-driven, top-down attention and image-driven, bottom-up attention is crucial for visual search. Yet, previous research has mostly focused on models that are purely top-down or bottom-up. Here, we propose a new model that combines both. The bottom-up component computes the visual salience of scene locations in different feature maps extracted at multiple spatial scales. The topdown component uses accumulated statistical knowledge of the visual features of the desired search target and background clutter, to optimally tune the bottom-up maps such that target detection speed is maximized. Testing on 750 artificial and natural scenes shows that the model's predictions are consistent with a large body of available literature on human psychophysics of visual search. These results suggest that our model may provide good approximation of how humans combine bottom-up and top-down cues such as to optimize target detection speed.
Objects Are Highlighted by Spatial Attention
Authors: A. Martínez, W. Teder-sälejärvi, M. Vazquez, S. Molholm, J. J. Foxe, D. C. Javitt, F. Di Russo, M. S. Worden, S. A. Hillyard
Venue: Journal of Cognitive Neuroscience (2006)

Selective attention may be focused upon a region of interest within the visual surroundings, thereby improving the perceptual quality of stimuli at that location. It has been debated whether this spatially selective mechanism plays a role in the attentive selection of whole objects in a visual scene. The relationship between spatial and object-selective attention was investigated here through recordings of event-related brain potentials (ERPs) supplemented with functional magnetic brain imaging (fMRI). Subjects viewed a display consisting of two bar-shaped objects and directed attention to sequences of stimuli (brief corner offsets) at one end of one of the bars. Unattended stimuli belonging to the same object as the attended stimuli elicited spatiotemporal patterns of neural activity in the visual cortex closely resembling those elicited by the attended stimuli themselves, albeit smaller in amplitude. This enhanced neural activity associated with object-selective attention was localized by use of ERP dipole modeling and fMRI to the lateral occipital extrastriate cortex. We conclude that object-selective attention shares a common neural mechanism with spatial attention that entails the facilitation of sensory processing of stimuli within the boundaries of an attended object.
RBF-Neural Network Adaptive PID Control for 3-Axis Stabilized Tracking System
Authors: Zhi-gang Liu, Jun-zheng Wang
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

The 3-axis stabilized tracking system is a vital part of the anti-aircraft system. To achieve the demand on swiftness, precision and stability, an adaptive PID control algorithm based on RBF-NN is introduced. In order to verify the feasibility of the method, several experiments were taken under the same conditions while using both the traditional PID and the adaptive RBF-NN PID. The steady state error is 0.003°, and the maximum tracking error is 0.203° when the signal frequency is 0.1Hz and the amplitude is 20° .The results of experiments proved that the RBF-NN adaptive PID controller performs well in the actual 3-axis stabilized tracking control system.
A perceptually significant block-edge impairment metric for digital video coding
Authors: S. Suthaharan
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A new perceptually significant block-edge impairment metric (PS-BIM) is presented in this paper as a quantitative distortion measure to evaluate blocking artifacts in block-based video coding. This distortion measure does not require the original video sequence as a comparative reference and is found to be consistent with subjective evaluation.
Securing wireless systems via lower layer enforcements
Authors: Zang Li, Wenyuan Xu, Rob Miller, Wade Trappe
Venue: Proceedings of the 5th ACM workshop on Wireless security (2006)

Although conventional cryptographic security mechanisms are essential to the overall problem of securing wireless networks, these techniques do not directly leverage the unique properties of the wireless domain to address security threats. The properties of the wireless medium are a powerful source of domain-specific information that can complement and enhance traditional security mechanisms. In this paper, we propose to utilize the fact that the radio channel decorre-lates rapidly in space, time and frequency in order to to establish new forms of authentication and confidentiality that operate at the physical layer and can be used to facilitate cross-layer security paradigms. Specifically, for authentication services, we illustrate two channel probing techniques that can be used to verify the authenticity of a transmitter. Similarly, for confidentiality, we examine several strategies for establishing shared secrets/keys between two communicators using the wireless medium. These strategies range from extracting keys from channel state information, to utilizing the channel variability to secretly disseminate keys. We then validate the feasibility of using physical layer techniques for securing wireless systems by presenting results from experiments involving the USRP/GNURadio software defined radio platform.
Dynamical control of decay and decoherence in complex quantum systems
Authors: G. Kurizki, A. G. Kofman
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

A unified theory is given of dynamically modified decay and decoherence in driven quantum systems that are coupled to arbitrary finite-temperature reservoirs and undergo random phase fluctuations. Criteria for the optimization of the suppression and the limitations of this approach are obtained. Decay acceleration by frequent measurements (interruptions of the coupling), known as the anti-Zeno effect (AZE) is argued to be much more ubiquitous than its inhibition in one- or two-level systems coupled to reservoirs (continua). In multilevel systems, frequent measurements cause accelerated decay by destroying the multilevel interference, which tends to inhibit decay in the absence of measurements.
Practical type inference for arbitrary-rank types
Authors: Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Mark Shields
Venue: Journal of Functional Programming (2007)

Haskell's popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. One such feature is the ability to write functions with higher-rank types &ndash; that is, functions that take polymorphic functions as their arguments. Complete type inference is known to be undecidable for higher-rank (impredicative) type systems, but in practice programmers are more than willing to add type annotations to guide the type inference engine, and to document their code. However, the choice of just what annotations are required, and what changes are required in the type system and its inference algorithm, has been an ongoing topic of research. We take as our starting point a $\lambda$-calculus proposed by Odersky and L&auml;ufer. Their system supports arbitrary-rank polymorphism through the exploitation of type annotations on $\lambda$-bound arguments and arbitrary sub-terms. Though elegant, and more convenient than some other proposals, Odersky and L&auml;ufer's system requires many annotations. We show how to use local type inference (invented by Pierce and Turner) to greatly reduce the annotation burden, to the point where higher-rank types become eminently usable. Higher-rank types have a very modest impact on type inference. We substantiate this claim in a very concrete way, by presenting a complete type-inference engine, written in Haskell, for a traditional Damas-Milner type system, and then showing how to extend it for higher-rank types. We write the type-inference engine using a monadic framework: it turns out to be a particularly compelling example of monads in action. The paper is long, but is strongly tutorial in style. Although we use Haskell as our example source language, and our implementation language, much of our work is directly applicable to any ML-like functional language.
An Investigation into the Subjective Experience of Icons: A Pilot Study
Authors: Martha G. R. Skogen
Venue: Proceedings of the conference on Information Visualization (2006)

In electronic applications, the graphical user interface ("GUI") contains information on many levels of visualization. The user interacts with the computer by manipulation of graphic elements on the screen, the smallest unit being the icon. This paper describes a pilot test conducted with eight students at the Norwegian University of Science and Technology (NTNU). The hypothesis is that simpler, less visually complicated icons will be understood (thus picked up) first. The more immediately communicative an icon is, the faster the response, hence, the lesser the cognitive load. An unconventional test method was used: students were asked to place user-interface icons from daily computer-use (e.g. "HOME") on a dual-axis matrix, based on their immediate reaction. Through the pilot test, I attempted to discover the relationship between 1) visual interpretation of icons and 2) the speed in which they are understood. Results showed that there is a consistency in how the icons were interpreted visually. The results also demonstrated a relationship between an icon's design and the order in which it was picked up. Future studies will target these issues more specifically.