ppxscal/embedding_network huggingface dataset:
Bayesian optimum designs for discriminating between models with any distribution
Authors: C. Tommasi, J. López-Fidalgo
Venue: Computational Statistics Data Analysis (2010)

The Bayesian KL-optimality criterion is useful for discriminating between any two statistical models in the presence of prior information. If the rival models are not nested then, depending on which model is true, two different Kullback-Leibler distances may be defined. The Bayesian KL-optimality criterion is a convex combination of the expected values of these two possible Kullback-Leibler distances between the competing models. These expectations are taken over the prior distributions of the parameters and the weights of the convex combination are given by the prior probabilities of the models. Concavity of the Bayesian KL-optimality criterion is proved, thus classical results of Optimal Design Theory can be applied. A standardized version of the proposed criterion is also given in order to take into account possible different magnitudes of the two Kullback-Leibler distances. Some illustrative examples are provided.
Fast Object Tracking in Intelligent Surveillance System
Authors: Ki-Yeol Eom, Tae-Ki Ahn, Gyu-Jin Kim, Gyu-Jin Jang, Moon-Hyun Kim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

In this paper we present the improved Fast Time Series Evaluation(IFTSE) algorithm that can fast and efficiently track the objects in bad environment conditions. Object tracking in intelligent surveillance system is an important part to identify suspicious objects' behavior. But object tracking is exhaustive and time-consuming process and we cannot also efficiently search the trajectory of detected objects due to bad conditions (e.g. bad camera capacity, dust particles in the air, lighting changes). To demonstrate the performance of the proposed IFTSE algorithm for tracking the objects, we introduce evaluation metrics. A prototype tracking system that IFTSE algorithm is employed is implemented using Visual C++. We increase true positive rate by approximately 6% and reduce false alarm rate by approximately 2% and reduce id change by approximately 30%.
A Model Based Method for Overall Well Focused Catadioptric Image Acquisition with Multi-focal Images
Authors: Weiming Li, Youfu Li, Yihong Wu
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Based on an analysis on the spatial distribution property of virtual features, we propose that the shapes of the best focused image regions in multi-focal catadioptric images can be modeled by a series of neighboring concentric annuluses. Based on this model, an over-all well focused image can be obtained by combining the best focused regions from a set of multi-focal images in a fast and reliable manner. A robust algorithm for estimating the model parameters is presented. Experiments with real catadioptric images under a variety of scenes verify the validity of the model and the robust performance of the algorithm.
Towards Standardized Pen-Based Annotation of Breast Cancer Findings
Authors: Suzanne Kieffer, Annabelle Gouze, Ronald Moncarey, Christian Brussel, Jean-François Wispelaere, Françoise Kayser, Benoît Macq
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

The development of computer technologies provides a means to support and facilitate the daily activities of potentially all users. This may be of particular importance for experts in breast cancer imaging and diagnosis. While many research efforts have been carried out separately on the implementation of task-oriented systems, much less effort has been undertaken to design and develop technologies compliant with domain standards or in accordance with end-user needs and expectations. This further suggests the need to improve both the usefulness and the usability of breast cancer-dedicated systems. This paper reports the results of a development method combining the application of user-centered design together with usability development methods. At different time frames in the life-cycle, the development method employed knowledge elicitation interviews, scenario-focused questionnaires, paper mock-ups and usability tests. Owing to its naturalness and its convenience, pen-based interaction with a graphics tablet was chosen as the modality to interact with the system. Additional innovative solutions were designed and implemented in order to facilitate and improve the visualization and the manipulation of data during the lesion characterization: namely an icon framework, a star-menu and a semi-automatic lesion detection system. The resulting user interface is a pen-based interactive tool supporting visualization, navigation, standardized lesion characterization and reporting. The usability tests suggest that it provides end-users with an efficient, reliable and usable system.
RBF Neural Network-Based Sliding Mode Control for Brushless Doubly Fed Machine
Authors: Zongkai Shao, Yuedong Zhan
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

In this paper, based on a radial basis function (RBF) neural network, a sliding mode control (SMC) strategy for brushless doubly fed machine (BDFM) is presented. The operating principle of BDFM has been introduced. The dynamic model of rotor field oriented and electromagnetic torque for BDFM is expressed. The proposed controller for BDFM eliminates the chattering encountered by most SMC schemes,and employs the robustness and excellent static and dynamic performances of SMC in the control system. Computer simulation results show that the proposed control strategy is of the feasibility, correctness and effectiveness.
A Novel Approach to Estimate Fractal Dimension from Closed Curves
Authors: André R. Backes, João B. Florindo, Odemir M. Bruno
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

An important point in pattern recognition and image analysis is the study of properties of the shapes used to represent an object in an image. Particularly, an interesting measure of a shape is its level of complexity, a value that can be obtained from its fractal dimension. Many methods were developed for estimating the fractal dimensions of shapes but none of these are efficient for every situation. This work proposes a novel approach to estimate the fractal dimension from shape contour by using Curvature Scale Space (CSS). Efficiency of the technique in comparison to the well-known method of Bouligand-Minkowski. Results show that the use of CSS yields fractal dimension values robust to several shape transformations (such as rotation, scale and presence of noise), so providing interesting results for a process of classification of shapes based on this measure.
Stochastic optimization method for signalized traffic signal systems
Authors: Deependra Singh, Rajan Singh
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2009)

Various simulation programs and optimization techniques have evolvedthat aid the traffic engineer in the optimization process. None of theoptimization programs consider the day to- day stochastic variability in thedelay during the optimization process. The purpose of this paper is toestimate variability in delay at signalized intersections and incorporatethe variability in the optimization process. An analytical methodology tocompute the variance of delay for an isolated intersection and arterialintersections is developed. In this paper delay variance is computed for anisolated intersection using expectation function method for under-saturatedconditions.
An Approach for Image Thresholding Using CNN Associated with Histogram Analysis
Authors: Jiayin Kang, Wenjuan Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Thresholding is one of the old, simple, and popular techniques for image segmentation, and has been widely studied. In this paper, an approach for image thresholding based on cellular neural network (CNN) associated with histogram analysis is presented. The approach realized by threshold CNN (T-CNN), in which the threshold is obtained via histogram-based automatic searching algorithm. Experimental results on real images show that the proposed approach can extract the objects from the background effectively with better visual quality than other methods.
Applying Recursive EM to Scene Segmentation
Authors: Alexander Bachmann
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

In this paper a novel approach for the interdependent task of multiple object tracking and scene segmentation is presented. The method partitions a stereo image sequence of a dynamic 3-dimensional (3D) scene into its most prominent moving groups with similar 3D motion. The unknown set of motion parameters is recursively estimated using an iterated extended Kalman filter (IEKF) which will be derived from the expectation-maximization (EM) algorithm. The EM formulation is used to incorporate a probabilistic data association measure into the tracking process. In a subsequent segregation step, each image point is assigned to the object hypothesis with maximum a posteriori (MAP) probability. Within the association process, which is implemented as labeling problem, a Markov Random Field (MRF) is used to express our expectations on spatial continuity of objects. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation
Authors: Murat Cenk, Cetin Kaya Koc, Ferruh Ozbudak
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation as Toom-Cook method together with field extensions. Furthermore, the proposed method can be usedwhen Toom-Cook method cannot be applied directly. Explicit formulae improving the previous results in many cases are obtained.
Invocation of operations from script-based Grid applications
Authors: Maciej Malawski, Tomasz Bartyński, Marian Bubak
Venue: Future Generation Computer Systems (2010)

In this paper we address the complexity of building and running modern scientific applications on various Grid systems with heterogeneous middleware. As a solution we have proposed the Grid Operation Invoker (GOI) which offers an object-oriented method invocation semantics for interacting with diverse computational services. GOI forms the core of the ViroLab virtual laboratory and it is used to invoke operations from within in-silico experiments described using a scripting notation. We describe the details of GOI (including architecture, technology adapters and asynchronous invocations) focusing on a mechanism which allows adding high-level support for batch job processing middleware, e.g. EGEE LCG/gLite. As an example, we present the NAMD molecular dynamics program, deployed on EGEE infrastructure. The main achievement is the creation of the Grid Object abstraction, which can be used to represent and access such diverse technologies as Web Services, distributed components and job processing systems. Such an application model, based on high-level scripting, is an interesting alternative to graphical workflow-based tools.
Supervised ranking for pronoun resolution: some recent improvements
Authors: Vincent Ng
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

A recently-proposed machine learning approach to reference resolution -- the twin-candidate approach -- has been shown to be more pormising than the traditional single-candidate approach. This paper presents a pronoun interpretation system that extends the twin-candidate framework by (1) equippmg it with the ability to identify non-referential pronouns. (2) training different models for handling different types of pronouns, and (3) incorporating linguistic knowledge sources that are generally not employed in traditional pronoun resolvers. The resulting system, when evaluated on a standard coreference corpus, outpreforms not only the original twin-candidate approach but also a state-of-the-art pronoun resolver.
Introduction to: The Myths of Object-Orientation
Authors: Jan Vitek
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

Inviting a banquet speaker is a responsibility of the ECOOP Program Chair. The charter of the speaker is to address an audience at the juncture between information overload from a long day of conferencing and hunger from a walk around town. Thus a successful banquet speech is at the same time entertaining, thought provoking and brief. I have known James Noble for more than ten years and he certainly fits the bill for a banquet speaker. James has worked on most things OO, from the ownership types that he helped invent, to design patterns, dynamic languages and, of course, his musings on post-modernism in software construction. He is known for his wit and his ability to come up with ideas that, at first, sound crazy, then appear insane, and are, in final analysis, quite brilliant. I could not hope for a better speaker than James and was elated when he accepted my invitation.
Change in Control
Authors: John Hoogland
Venue: Proceedings of the 7th International Conference on Business Process Management (2009)

Change is a popular word since Barack Obama so successfully used it in his campaign to become president of the US. Change almost became a synonym for "yes, we can". Change, and things will improve. Suddenly change is sexy. We don't seem to suffer from resistance to change anymore. People now LIKE to change?Control usually is considered to almost be opposite to change. Control is not sexy. It is associated with accountants, budget restrictions, penalties, rules. It is considered to be counterproductive. You need it for compliance, but how easy would it be to change without control?BPM is stuck in the middle. It used to be positioned as a technology that improves efficiency, effectiveness and quality. Cheaper, faster and better. But suddenly BPM is all about Agility. BPM for change. BPM is sexy too! At the same time, BPM is considered to be a tool for compliance, risk management and a means to guarantuee SLA's, KPI's, etc. Control!So how can this be? BPM does not bring agility by itself. Nothing is more agile than processes that are not under control of any system. BPM is only called agile, because it gives more flexibility than built-in process control in legacy applications. At least, that is what we all believe (or say we believe). We call this the flexibility paradox. Process automation adds control, takes away flexibility and at the same time brings agility. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Classes, Jim, But Not as We Know Them -- Type Classes in Haskell: What, Why, and Whither
Authors: Simon Peyton Jones
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

Haskell is now quite widely used, but its most important contributions are the ideas that it embodies. In this talk I will focus on one of these ideas, namely type classes, with a few anecdotes and reflections along the way about the process of developing the language.Type classes are probably Haskell's most distinctive feature. The original idea is very neat and, better still, it led to a long series of subsequent generalisations and innovations. Indeed, although the language is now nineteen years old, Haskell's type system is still in a state of furious development. For example, I am involved in adding type-level functions to Haskell, as I will briefly describe.I will explain what type classes are, how they differ from the classes of mainstream object oriented languages, why I think they are so cool, and what the hot topics are. I'll give plenty of examples, so you don't need to already know Haskell.
Dynamic ADTs: a "don't ask, don't tell" policy for data abstraction
Authors: Geoff Wozniak, Mark Daley, Stephen Watt
Venue: Proceedings of the 2007 International Lisp Conference (2007)

We outline an approach to abstract data types (ADTs) that allows an object of the type specified by the ADT to take on one of many possible representations. A dynamic abstract data type (DADT) is dual to dynamic algorithm selection and facilitates profiling of data in conjunction with the profiling of code. It also permits a programmer to delay or ignore details pertaining to data representation and enhance the efficiency of some algorithms by changing representations at run time without writing code extraneous to the algorithm itself. Additionally, we demonstrate that run time optimization of data objects is possible and allows for acceptable performance compared to traditional ADTs. An implementation is presented in Common Lisp.
Ning For Dummies
Authors: Manny Hernandez
Venue: For Dummies (2009)

Ning is a cool, free social networking platform, and you can learn how to use Ning quickly and easily with Ning For Dummies. If you have a cause to promote or a passion about a topic, heres how to explore existing networks and interact with others who share your obsession, as well as how to start one of your own. Begin by joining other networks and participating in groups. Then youll find out how to create your own social network, develop your profile, customize your networks look and feel, set up privacy controls, oversee participation, and manage all the details. Investigate existing networks, see how to join private networks, and manage your profile for privacy Add photos, videos, and music files to existing networks Discover the comment wall, rate items from members, moderate comments on your blog, and respond to events Start a discussion, invite people to an event, or create a group Set up your network, decide if it should be public or private, research the competition, and find your niche Choose a good Web address and learn to monitor traffic with Google Analytics Give your main page character with custom widgets and personalized features Ning is fun, easy, and free. Ning For Dummies shows you how to plan your network so it stands out from the crowd, manage interaction, include multimedia, and more! The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Hybrid Method of Indexing Multiple-Inheritance Hierarchies
Authors: Jacek Lewandowski, Henryk Rybinski
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

The problem of efficient processing of the basic operations on ontologies, such as subsumption checking, or finding all subtypes of a given type, becomes of a very high importance. In the paper we present a hybrid approach of organizing multi-hierarchical structures, combining numbering schemes [1], [13] with "gene-based" methods [10], [17]. The proposed method generalizes earlier solutions and inherits advantages of earlier approaches. The obtained structure preserves the feature of incremental changes of the ontology structure. The experiments performed show significant efficiency results in accessing ontology resources for performing processes specific for semantic web.
Sources of top-down control in visual search
Authors: Ralph Weidner, Joseph Krummenacher, Brit Reimann, Hermann J. Müller, Gereon R. Fink
Venue: Journal of Cognitive Neuroscience (2009)

Endogenous control of visual search can influence search guidance at the level of a supradimensional topographic saliency map [Wolfe, J. M. Guided Search 2.0: A revised model of visual search. Psychonomic Bulletin & Review,1, 202-238, 1994], and modulate nonspatial mechanisms coding saliency in dimension-specific input modules [Müller, H. J., Reimann, B., & Krummenacher, J. Visual search for singleton feature targets across dimensions: Stimulus-and expectancy-driven effects in dimensional weighting. Journal of Experimental Psychology: Human Perception and Performance,29, 1021-1035, 2003]. The current experiment used fMRI to dissociate these mechanisms in a singleton feature search task in which the likely target dimension (color or orientation) was semantically precued and target saliency in each dimension was varied parametrically. BOLD signal increases associated with increased demands for top-down guidance were observed within the fronto-parietal attention network and in the right anterior middle frontal gyrus. Decreasing requirements for top-down control led to BOLD signal increases in medial anterior prefrontal cortex, consistent with a gating mechanism in favor of stimulus-related processing [Burgess, P. W., Dumontheil, I., & Gilbert, S. J. The gateway hypothesis of rostral prefrontal cortex (area 10) function. Trends in Cognitive Sciences,11, 290-298, 2007]. Another network of brain areas consisting of left lateral fronto-polar cortex, the left supramarginal gyrus, and the cerebellum, as well as a bilateral network consisting of the posterior orbital gyrus, the inferior frontal gyrus, and the pre-SMA were associated with top-down dimensional (re-) orienting. These data argue in favor of distinct endogenous control systems for visuospatial and dimension-based attentional processing. Finally, cue validity modulated saliency processing in the left temporo-parietal junction (TPJ), pointing to a crucial role of the left TPJ in integrating an endogenous dimension-based attention set with bottom-up saliency signals.
Learning to analyze binary computer code
Authors: Nathan Rosenblum, Xiaojin Zhu, Barton Miller, Karen Hunt
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification is the crucial first step in analyzing many malicious, commercial and legacy software, which lack full symbol information that specifies FEPs. Existing pattern-matching FEP detection techniques are insufficient due to variable instruction sequences introduced by compiler and link-time optimizations. We formulate the FEP identification problem as structured classification using Conditional Random Fields. Our Conditional Random Fields incorporate both idiom features to represent the sequence of instructions surrounding FEPs, and control flow structure features to represent the interaction among FEPs. These features allow us to jointly label all FEPs in the binary. We perform feature selection and present an approximate inference method for massive program binaries. We evaluate our models on a large set of real-world test binaries, showing that our models dramatically outperform two existing, standard disassemblers.