ppxscal/embedding_network huggingface dataset:
Learning Term Spaces Based on Visual Feedback
Authors: Michael Granitzer, Thomas Neidhart, Mathias Lux
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Extracting and visualizing concepts and relationship between text documents strongly depends on the used similarity measure. In order to provide meaningful visualizations and to extract useful knowledge from document collections, user needs must be captured by the internal representation of documents, and the used similarity measure. In most applications the Vector Space Model and the Cosine similarity are used therefore and serve as good approximations. Nevertheless, influencing similarities between documents is rather hard, since parameter tuning relies heavily on expert knowledge of the underlying algorithms, and the influence of different weighting schemes and similarity measures is not known before. In this paper we present an approach on how to adapt the vector space representation of documents by giving visual feedback to the system. Our approach starts by clustering a corpus of text documents and visualizing the results using multi dimensional scaling techniques. Afterwards, a 2D landscape visualization is shown which can be manipulated by the user. Based on these manipulations the high dimensional representation of the documents is adapted to fit the users need more precisely. Our experiments show that iterating these steps results in an adapted representation of documents and similarities, generating layouts as intended by the user and furthermore increases clustering accuracy. While this paper only investigates the influence on clustering and visualization, the method itself may also be used for increasing classification and retrieval performance since it adapts to the users need of similarity.
Building a Better Filter: How To Create a Safer Internet and Avoid the Litigation Trap
Authors: Erin Egan, Tim Jucovy
Venue: IEEE Security and Privacy (2006)

The proliferation of spyware, adware, offensive Web sites, and spam increasingly drains economic resources, forcing businesses and individuals to spend inordinate amounts of time and money to prevent and remove these items.This article examines some of those claims and suggests a series of steps in the promotion, design, implementation, and operation of Internet safety products that their developers and users can take to reduce the risks these claims pose.
Dynamic allocation for scratch-pad memory using compile-time decisions
Authors: Sumesh Udayakumaran, Angel Dominguez, Rajeev Barua
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2006)

In this research, we propose a highly predictable, low overhead, and, yet, dynamic, memory-allocation strategy for embedded systems with scratch pad memory. A scratch pad is a fast compiler-managed SRAM memory that replaces the hardware-managed cache. It is motivated by its better real-time guarantees versus cache and by its significantly lower overheads in energy consumption, area, and overall runtime, even with a simple allocation scheme. Primarily scratch pad allocation methods are of two types. First, software-caching schemes emulate the workings of a hardware cache in software. Instructions are inserted before each load/store to check the software-maintained cache tags. Such methods incur large overheads in runtime, code size, energy consumption, and SRAM space for tags and deliver poor real-time guarantees just like hardware caches. A second category of algorithms partitions variables at compile-time into the two banks. However, a drawback of such static allocation schemes is that they do not account for dynamic program behavior. It is easy to see why a data allocation that never changes at runtime cannot achieve the full locality benefits of a cache. We propose a dynamic allocation methodology for global and stack data and program code that; (i) accounts for changing program requirements at runtime, (ii) has no software-caching tags, (iii) requires no runtime checks, (iv) has extremely low overheads, and (v) yields 100&percnt; predictable memory access times. In this method, data that is about to be accessed frequently is copied into the scratch pad using compiler-inserted code at fixed and infrequent points in the program. Earlier data is evicted if necessary. When compared to a provably optimal static allocation, results show that our scheme reduces runtime by up to 39.8&percnt; and energy by up to 31.3&percnt;, on average, for our benchmarks, depending on the SRAM size used. The actual gain depends on the SRAM size, but our results show that close to the maximum benefit in runtime and energy is achieved for a substantial range of small SRAM sizes commonly found in embedded systems. Our comparison with a direct mapped cache shows that our method performs roughly as well as a cached architecture.
Formal analysis of secure contracting protocol for e-tendering
Authors: Rong Du, Ernest Foo, Colin Boyd, Kim-Kwang Raymond Choo
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

Formal specification and verification of protocols have been credited for uncovering protocol flaws; revealing inadequacies in protocol design of the Initial Stage and Negotiation Stage; and proved that improved protocol performs in the desired manner while under modelled attacks from dishonest players. It also shows how formal methods can be used by protocol designer to achieve a better design of a complex system. Formal methods can also populate an abstract concept with a more complete and consistent protocol specification. Complex system protocol can be easily specified with simplifying assumptions for a high level of protocol verification. This set of assumptions can then be used to further explore the protocol. Using formal methods for complex secure system protocol design will provide not only better quality protocol but could also be the first step in advancing an abstract concept to a more practical stage for development.
Detection and measurement of hilar region in chest radiograph
Authors: Mira Park, Jesse S. Jin, Laurence S. Wilson
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

This paper presents a method to detect and measure the hilar region of chest radiographs. The reason why there is no suggested method to detect hilar region is that the hilar region does not have a clear shape or specific texture. We use a very simple but very effective method to detect the location and size of the hilar region of chest radiographs.
A technique for generic iteration and its optimization
Authors: Stephen M. Watt
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming (2006)

Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as programs that suspend and resume control. This paper addresses two problems that remain in the use of iterators today: The first problem is that iterators represented as state-saving objects in languages such as C++ or Java typically have logic that is much more complicated than control-based iterators. This paper presents a program structuring technique that allows object-based iterators to be implemented with the same clarity as control-based iterators. The second problem is that the usual implementations of control-based iterators are not sufficiently efficient for high-performance applications. This paper presents a code optimization technique that can be applied to control-based iteration to produce efficient natural loops at the machine code level. Combined, these two results allow iterators for complex data structures to be easily written and efficiently implemented.
Bounded sets of KKT multipliers in vector optimization
Authors: Joydeep Dutta, C. S. Lalitha
Venue: Journal of Global Optimization (2006)

In this article we discuss the conditions required to guarantee the non-emptiness and the boundedness of certain subsets of the set of Lagrange multipliers for an inequality and equality constrained vector minimization problem.
Arbitrary groups as two-point stabilisers of symmetric groups acting on partitions
Authors: J. P. James
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

We give a short, direct proof that given any finite group G there exist positive integers k and l and partitions ¿1and ¿2 of {1, ¿, kl } into l subsets of size k such that (S kl ) ¿ 1, ¿ 2¿ G.The method used will also show that given any finite group G there exists a regular bipartite graph whose automorphism group is isomorphic to G
DevCOP: A Software Certificate Management System for Eclipse
Authors: Mark Sherriff, Laurie Williams
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

During the course of software development, developers will employ several different verification and validation (V&V) practices with their software. However, these efforts might not be recorded or maintained in an effective manner. We have built Defect Estimation with V&V Certificates on Programming (DevCOP), a software certificate management system. With DevCOP, developers can automatically track and maintain a persistent record of the V&V practices used during development via certificates. With this V&V information, developers and managers can better manage their V&V efforts within a system. Detailed information such as coverage of particular V&V techniques over the system or the amount of V&V performed on a single function can be provided. Developers can also use this V&V information post hoc to see which techniques were more effective at removing defects. In our future work, we are researching a parametric model which utilizes these certificates to estimate defect density as development proceeds.
Expected shortfall in credit portfolios with extremal dependence
Authors: Achal Bassamboo, Sandeep Juneja, Assaf Zeevi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We consider the risk of a portfolio comprised of loans, bonds, and financial instruments that are subject to possible default. We are interested in efficiently estimating expected excess loss conditioned on the event that the portfolio incurs large losses over a fixed time horizon; this risk measure is often referred to as expected shortfall. We consider a heterogeneous mix of obligors and assume a portfolio dependence structure that supports extremal dependence among obligors and does not hinge solely on correlation. We first derive sharp asymptotics that illustrate the implications of extremal dependence among obligors in the risk of the portfolio. Using this as a stepping stone, we develop a multi-stage importance sampling algorithm that is shown to have bounded relative error in estimating expected shortfall.
Illumination Correction for Content Analysis in Uterine Cervix Images
Authors: Hila Dvir, Shiri Gordon, Hayit Greenspan
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Illumination field inhomogeneity strongly affects the visual appearance of an image. It has a major influence on automatic information extraction within an image and its correction is critical for comparison or model learning across images. In this work a unique medical repository of cervicographic images ("cervigrams") collected by the National Center Institute (NCI), National Institute of Health (NIH) is being addressed. The large diversity of cervix shapes within this database, as well as the acquisition set-up, lead to varying illumination conditions among and within the cervigrams, which hamper their automatic analysis. Illumination correction is therefore one of the first preprocessing steps required prior to the image analysis task. This paper presents a method for illumination correction in cervigrams based on a generalized expectation maximization (GEM) algorithm that interleaves pixels classification with estimation of class distribution and illumination field parameters. For cross-image analysis a normalization of the image dynamic range is conducted, using prior knowledge on cervix tissue intensity distribution. Experimental results are provided and evaluated on a set of 110 cervigrams that were manually labeled by an NCI expert. Unsupervised segmentation as well as initial supervised tissue classification results are presented.
Improving learning in CS1 via tablet-PC-based in-class assessment
Authors: Kimberle Koile, David Singer
Venue: Proceedings of the second international workshop on Computing education research (2006)

This paper describes two pilot studies, one completed and one ongoing, that evaluate the use of Tablet PCs and a Tablet-PC-based classroom presentation system in an introductory computer science class. The presentation system, Classroom Presenter [2, 3], supports student wireless submission of digital ink answers to in-class exercises. In these studies, we evaluate the hypothesis that the use of such a system increases student learning by: (1) increasing student focus and attentiveness in class, (2) providing immediate feedback to both students and instructor about student misunderstandings, (3) enabling the instructor to adjust course material in real-time based upon student answers to in-class exercises, (4) increasing student satisfaction. The studies evaluate each of the above four parameters by means of classroom observation, surveys, and interviews.
The cover time of sparse random graphs
Authors: Colin Cooper, Alan Frieze
Venue: Random Structures Algorithms (2007)

We study the cover time of a random walk on graphs G &epsilon; Gn,p when $p={c\log n \over n}, c>1$. We prove that whp, the cover time, is asymptotic to $c\log({c \over c-1})n\log n$. &copy;Wiley Periodicals, Inc. Random Struct. Alg., 2007
A genetic algorithm for a bi-objective capacitated arc routing problem
Authors: P. Lacomme, C. Prins, M. Sevaux
Venue: Computers and Operations Research (2006)

The capacitated arc routing problem (CARP) is a very hard vehicle routing problem for which the objective-in its classical form-is the minimization of the total cost of the routes. In addition, one can seek to minimize also the cost of the longest trip.In this paper, a multi-objective genetic algorithm is presented for this more realistic CARP. Inspired by the second version of the Non-dominated sorted genetic algorithm framework, the procedure is improved by using good constructive heuristics to seed the initial population and by including a local search procedure. The new framework and its different flavour is appraised on three sets of classical CARP instances comprising 81 files.Yet designed for a bi-objective problem, the best versions are competitive with state-of-the-art metaheuristics for the single objective CARP, both in terms of solution quality and computational efficiency: indeed, they retrieve a majority of proven optima and improve two best-known solutions.
Fast Modeling of Curved Object from Two Images
Authors: Jiguo Zeng, Yan Zhang, Chen Liu, Shouyi Zhan
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

A method of modeling curved object from two images is proposed. 3D curved object is represented by the standard parametric surface. The silhouettes of the images photographed from the frontal and lateral position can be obtained by user interaction. They are inputted as the linear constraints of the quadratic object function to find the smoothest curved surfaces of the object. In order to reduce the amount of user interaction, Gaussian mixture model based image segmentation algorithm is used to obtain the silhouettes. We demonstrate the effectiveness of this method in modeling real curved objects.
Image classification using spatial relationship matrix based on color spatio-histogram
Authors: Woosaeng Kim
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Efficient and reliable content-based image retrieval and classification techniques are required for the large image databases. Humans perceive images by breaking the scenes into regions and objects. We, therefore, present a novel approach for extracting color and spatial relationships among image regions. For this, we propose a color spatio-histogram and a bin image which express not only the color distribution but also the spatial information of an image. The system constructs a spatial relationship matrix (SRM) with representative bin pixels of a bin image in order to classify natural images, which define prototypical color and spatial relationships of image regions recurred throughout the image collection. Experiment results show that our scheme performs well for image classification.
Low-power acoustic modem for dense underwater sensor networks
Authors: Jack Wills, Wei Ye, John Heidemann
Venue: Proceedings of the 1st ACM international workshop on Underwater networks (2006)

Significant progress has been made in terrestrial sensor networks to revolutionize sensing and data collection. To bring the concept of long-lived, dense sensor networks to the underwater environment, there is a compelling need to develop low-cost and low-power acoustic modems for short-range communications. This paper presents our work in designing and developing such a modem. We describe our design rationale followed by details of both hardware and software development. We have performed preliminary tests with transducers for in-air communications.
Higher order feature selection for text classification
Authors: Jan Bakus, Mohamed S. Kamel
Venue: Knowledge and Information Systems (2006)

In this paper, we present the MIFS-C variant of the mutual information feature-selection algorithms. We present an algorithm to find the optimal value of the redundancy parameter, which is a key parameter in the MIFS-type algorithms. Furthermore, we present an algorithm that speeds up the execution time of all the MIFS variants. Overall, the presented MIFS-C has comparable classification accuracy (in some cases even better) compared with other MIFS algorithms, while its running time is faster. We compared this feature selector with other feature selectors, and found that it performs better in most cases. The MIFS-C performed especially well for the breakeven and F-measure because the algorithm can be tuned to optimise these evaluation measures.
Modeling and Recognition of Gesture Signals in 2D Space: A Comparison of NN and SVM Approaches
Authors: Farhad Dadgostar, Abdolhossein Sarrafzadeh, Chao Fan, Liyanage De Silva, Chris Messom
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

In this paper we introduce a novel technique for modeling and recognizing gesture signals in 2D space. This technique is based on measuring the direction of the gradient of the movement trajectory as features of the gesture signal. Each gesture signal is represented as a time series of gradient angle values. These features are classified by applying a given classification method. In this article we compared the accuracy of a feed forward Artificial Neural Network with a Support Vector Machine using a radial kernel. The comparison was based on the recorded data of 13 gesture signals as training and testing data. The average accuracy of the ANN and SVM were 98.27% and 96.34% respectively. The false detection ratio was 3.83% for ANN and 8.45% for SVM, which suggests the ANN is more suitable for gesture signal recognition.
A Semantically-enhanced Component-based Architecture for Software Composition
Authors: Juan Miguel Gomez, Sung-Kook Han, Ioan Toma, Brahmananda Sapkota, Angel Garcia-Crespo
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Currently, a large amount of information resources are available on the the Web. These information resources include not only the data existing on the web but also dynamic applications, namely, software components distributed all over the Internet. An increasing demand of a proper model and architecture for composition of software components has triggered a huge amount of integration efforts. Most of the known integration approaches ignore the services and operational aspects offered by software components. They are mostly ad hoc and hardly customized solutions. This paper presents a semantically-enhanced model and architecture for composition of software components, specially, software component, basic reusable building blocks of component-based application systems.
Making Software Agents User-Friendly
Authors: Qusay H. Mahmoud, Leslie Yu
Venue: Computer (2006)

A new architecture could make software agents accessible to the average computer user.
Fair cost-sharing methods for the minimum spanning tree game
Authors: Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès
Venue: Information Processing Letters (2006)

We study the problem of sharing in a fair manner the cost of a service provided to a set of players in the context of Cooperative Game Theory. We introduce a new fairness measure capturing the dissatisfaction (or happiness) of each player and we propose two cost sharing methods minimizing the maximum or average dissatisfaction of the clients for the classical minimum spanning tree game.
Polarization diversity for multiband UWB systems
Authors: F. Argenti, T. Bianchi, L. Mucchi, L. S. Ronga
Venue: Signal Processing (2006)

Ultra-wideband (UWB) transmission provides a fast local range wireless connection using the same frequency spectrum assigned to other narrowband communication standards. A precise knowledge of the indoor transmission channel is necessary to obtain high performance. Several channel models have been presented in the literature, but normally without considering the distortion effect caused by a real UWB antenna. A detailed antenna model shows that the radiation pattern varies with frequency, i.e., different receiver positions and antenna orientations result in different antenna frequency responses. In order to obtain a more uniform coverage over the indoor area, two transmitting antennas with orthogonal polarization can be used. The receiver can use a single antenna whose orientation and position is arbitrary within the coverage area, resulting in a special case of a 2:1 MISO system in which a space-time encoding is used at the transmitter. The target is to employ the polarization diversity to obtain a constant quality of symbol detection while the receiver moves around in the coverage area. The proposed polarization diversity scheme is applied in an UWB multiband scenario and it is compared to both a single antenna scheme and a classical space diversity scheme employing a single polarized antenna array.
Moderating the Price Sensitivity of Online Customers
Authors: Hee-Woong Kim, Darren Ee Se Toh
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

If an online vendor understands how to lower the effect of price on customer purchase, the vendor could generate more profit by lowering customers' price sensitivity in their Internet shopping. Hence, moderating the effect of price perception on purchase behavior is a primary concern for online vendors if they were to generate more profit and reduce the potential of price competition. This study provides a clear conceptualization of price sensitivity through a review of past literature, and proposes a new measurement method for changes in the effect of price perception on purchase. Based on pricing theory, this study examines the effects of trust, switching costs and convenience in moderating the effect of perceived price on purchase intention in the context of an online bookstore. We offer theoretical reasoning for the results and discuss the theoretical and practical implications of this study.