ppxscal/embedding_network huggingface dataset:
Textured Renyi Entropy for Image Thresholding
Authors: Ahmad Adel Abu Shareha, Mandava Rajeswari, Dhanesh Ramachandram
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

This paper introduces Textured Renyi Entropy for image thresholding based on a novel combination mechanism. The Renyi Entropy is extended by modifying its priori, while still preserving overall functionality. An optional priori is introduced to improve accuracy. The priori modification allows adding of texture information in an efficient way, which results in more accurate thresholding. Furthermore, the proposed mechanism allows adding other features after some normalization. Finally the novel way allows adding multiple features simultaneously using the modified priors.
Defining Digital Rights - Data Protection and Intellectual Property
Authors: Staff
Venue: I-WAYS - The Journal of E-Government Policy and Regulation (2005)

There is concern in Europe that the legitimate use of technologies to protect intellectual property could be detrimental to the protection of data of individuals. There is an increasing gap between the protection of individuals in the off-line and on-line worlds, especially considering generalized tracing and profiling of individuals. The EU Working Party on Protection of Individuals with Regard to Protection of Personal Data has prepared a document that calls for development of technical tools offering privacy compliant properties and more generally for a transparent and limited use of unique identifiers, with a choice option for the users. Further, it is concluded that investigations undertaken by copyright holders must be performed in a clear legal framework, especially as to the information that can legally be collected, and to the enforcement powers that can be attributed to these actors. The original document may be found at http://europa.eu.int/comm/internal_market/privacy/docs/wpdocs/2005/wp104_en.pdf. The following are extracts from this report. 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
Neural Network Based Algorithm for Multi-Constrained Shortest Path Problem
Authors: Jiyang Dong, Junying Zhang, Zhong Chen
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Multi-Constrained Shortest Path (MCSP) selection is a fundamental problem in communication networks. Since the MCSP problem is NP-hard, there have been many efforts to develop efficient approximation algorithms and heuristics. In this paper, a new algorithm is proposed based on vectorial Autowave-Competed Neural Network which has the characteristics of parallelism and simplicity. A nonlinear cost function is defined to measure the autowaves (i.e., paths). The M-paths limited scheme, which allows no more than M autowaves can survive each time in each neuron, is adopted to reduce the computational and space complexity. And the proportional selection scheme is also adopted so that the discarded autowaves can revive with certain probability with respect to their cost functions. Those treatments ensure in theory that the proposed algorithm can find an approximate optimal path subject to multiple constraints with arbitrary accuracy in polynomial-time. Comparing experiment results showed the efficiency of the proposed algorithm.
The Shrinking Property for NP and coNP
Authors: Christian Glaßer, Christian Reitwießner, Victor Selivanov
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We study the shrinking and separation properties (two notions well-known in descriptive set theory) for and and show that under reasonable complexity-theoretic assumptions, both properties do not hold for and the shrinking property does not hold for . In particular we obtain the following results. 1 and do not have the shrinking property, unless is finite. In general, and do not have the shrinking property, unless is finite. This solves an open question from [25]. 1 The separation property does not hold for , unless . 1 The shrinking property does not hold for , unless there exist -hard disjoint -pairs (existence of such pairs would contradict a conjecture by Even, Selman, and Yacobi [6]). 1 The shrinking property does not hold for , unless there exist complete disjoint -pairs. Moreover, we prove that the assumption is too weak to refute the shrinking property for in a relativizable way. For this we construct an oracle relative to which , , and has the shrinking property. This solves an open question by Blass and Gurevich [2] who explicitly ask for such an oracle.
Acoustic Fault Identification of Underwater Vehicles Based on SOM/OMRBF
Authors: Liye Tian, Kerong Ben, Song Tu, Lilin Cui
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A network model using Self-organizing map (SOM) and Outputs Modifiable Radial Basis Function (OMRBF) is proposed to identify acoustic fault of underwater vehicles. This model integrates unsupervised SOM with supervised OMRBF to accomplish incremental learning. The outputs neurons of this model can be modified on-line, and SOM is utilized to determine the optimal number of hidden neurons. Experiment results show that the proposed model can identify and remember new faults without forgetting the old ones, and it has good generalization ability.
A Chaos Based Robust Spatial Domain Watermarking Algorithm
Authors: Xianyong Wu, Zhi-Hong Guan, Zhengping Wu
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

This paper presents a novel spatial domain watermarking scheme based on chaotic maps. Two chaotic maps are employed in our scheme, which is different from most of the existing chaotic watermarking methods, 1-D Logistic map is used to encrypt the watermark signal, and generalized 2-D Arnold cat map is used to encrypt the embedding position of the host image. Simulation results show that the proposed digital watermarking scheme is effective and robust to commonly used image processing operations.
The method of lines for solution of the one-dimensional wave equation subject to an integral conservation condition
Authors: Fatemeh Shakeri, Mehdi Dehghan
Venue: Computers Mathematics with Applications (2008)

Hyperbolic partial differential equations with an integral condition serve as models in many branches of physics and technology. Recently, much attention has been expended in studying these equations and there has been a considerable mathematical interest in them. In this work, the solution of the one-dimensional nonlocal hyperbolic equation is presented by the method of lines. The method of lines (MOL) is a general way of viewing a partial differential equation as a system of ordinary differential equations. The partial derivatives with respect to the space variables are discretized to obtain a system of ODEs in the time variable and then a proper initial value software can be used to solve this ODE system. We propose two forms of MOL for solving the described problem. Several numerical examples and also some comparisons with finite difference methods will be investigated to confirm the efficiency of this procedure.
Image Threshold Using A-IFSs Based on Bounded Histograms
Authors: Pedro Couto, Humberto Bustince, Vitor Filipe, Edurne Barrenechea, Miguel Pagola, Pedro Melo-Pinto
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

Atanassov's intuitionistic fuzzy sets (A-IFSs) have been used recently to determine the optimal threshold value for gray-level image segmentation [1]. Atanassov's intuitionistic fuzzy index values are used for representing the unknowledge/ignorance of an expert on determining whether a pixel of the image belongs to the background or the object of the image. This optimal global threshold of the image is computed automatically, regardless of the actual image analysis process.Although global optimal thresholding techniques give good results under experimental conditions, when dealing with real images having several objects and the segmentation purpose is to point out some application-specific information, one should use heuristic techniques in order to obtain better thresholding results.This paper introduces an evolution of the above mentioned technique intended for use with such images. The proposed approach takes into account the image and segmentation specificities by using a two-step procedure, with a restricted set of the image gray-levels.Preliminary experimental results and comparison with other methods are presented.
Toward Expert Knowledge Representation for Automatic Breast Cancer Detection
Authors: Marina Velikova, Maurice Samulski, Nico Karssemeijer, Peter Lucas
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

In reading mammograms, radiologists judge for the presence of a lesion by comparing at least two breast projections (views) as a lesion is to be observed in both of them. Most computer-aided detection (CAD) systems, on the other hand, treat single views independently and thus they fail to account for the interaction between the breast views. Following the radiologist's practice, in this paper, we develop a Bayesian network framework for automatic multi-view mammographic analysis based on causal independence models and the regions detected as suspicious by a single-view CAD system. We have implemented two versions of the framework based on different definitions of multi-view correspondences. The proposed approach is evaluated and compared against the single-view CAD system in an experimental study with real-life data. The results show that using expert knowledge helps to increase the cancer detection rate at a patient level.
On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing
Authors: Mahmoud Elhaddad, Rami Melhem
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

We study the emulation of Output Queuing (OQ) using Combined Input-Output Queuing (CIOQ) switches in the setting where the emulated OQ switch and the CIOQ switch have buffer capacity B ¿ 1 packets at every output. We analyze the resource requirements of CIOQ policies in terms of the required fabric speedup and the additional buffer capacity needed at the CIOQ inputs.For the family of work-conserving scheduling algorithms, we find that whereas every greedy CIOQ policy is valid for OQ emulation at speedup B, no CIOQ policy is valid at speedup $s when preemption is allowed. We also find that CCF in particular is not valid at any speedup s < B. We then introduce a CIOQ policy, CEH, that is valid at speedup $s \geq \sqrt{2(B-1)}$. Under CEH, the buffer occupancy at any input never exceeds $1+\lfloor\frac{B-1}{s-1}\rfloor$.For non-preemptive scheduling algorithms, we characterize a trade-off between the CIOQ speedup and the input buffer occupancy. Specifically, we show that for any greedy policy that is valid at speedup s > 2, the input buffer occupancy cannot exceed $1+\lceil{\frac{B-1}{s-2}}\rceil$. We also show that at speedup 2, a greedy variant of the CCF policy requires input buffer capacity of only B packets for the emulation of non-preemptive OQ algorithms with PIFO service disciplines.
A Knowledge-Based Model Representation and On-Line Solution Method for Dynamic Vehicle Routing Problem
Authors: Lijun Sun, Xiangpei Hu, Zheng Wang, Minfang Huang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

We propose a knowledge-based model representation and on-line solution method for dynamic vehicle routing problem (DVRP) in the paper in order to realize on-line modeling and solution process of the problem. This knowledge-based model representation is composed of six components--B (Basic Data collector), R (Restrictions), I (Initial state generator),S (State operator), G (Goal state), and C (Controller). We term the representation BRISGC six-component model representation. Based on the representation, an on-line solution approach to DVRP is presented. And a real-world DVRP in e-Commerce is solved by the representation and solution method in case study. The result proves that the proposed approach is effective for online and real-time vehicle routing.
On the Computational Completeness of Equations over Sets of Natural Numbers
Authors: Artur Jeż, Alexander Okhotin
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Systems of equations of the form φ j (X 1, ..., X n ) = ¿ j (X 1, ..., X n ) with $1 \leqslant j \leqslant m$ are considered, in which the unknowns X i are sets of natural numbers, while the expressions φ j ,¿ j may contain singleton constants and the operations of union (possibly replaced by intersection) and pairwise addition . It is shown that the family of sets representable by unique (least, greatest) solutions of such systems is exactly the family of recursive (r.e., co-r.e., respectively) sets of numbers. Basic decision problems for these systems are located in the arithmetical hierarchy.
Lower Bounds for Succinct Data Structures
Authors: J. Ian Munro
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

Indexing text files with methods such as suffix trees and suffix arrays permits extremely fast search for substrings. Unfortunately the space cost of these can dominate that of the raw data. For example, the naive implementation of a suffix tree on genetic information could take 80 times as much space as the raw data. Succinct data structures offer a technique by which the extra space of the indexing can be kept, at least in principle, to a "little oh" with respect to the raw data. This begs the question of how much extra space is necessary to support fast substring searches of other queries such as the rank/select problem or representing a permutation so that both the forward permutation and its inverse can be determined quickly. We survey some lower bounds on this type of problem, most notably the work of Demaine and López-Ortiz and of Golynski.
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph
Authors: Eunhui Park, Kunsoo Park
Venue: Fundamenta Informaticae (2008)

The Boolean circuit is a simple and realistic model for parallel computation. Chung and Lee considered the problem of finding a maximum matching in a convex bipartite graph, which has two sets of vertices, A and B, such that for any vertex v of A, the neighbors of v in B are contiguous. They gave a Boolean circuit for the problem in O(log$^2$ n+log n&middot; log log n&middot; log b) depth and O(bn$^3$) size, where n is the number of vertices in set A of the convex bipartite graph and b is the number of bits representing a vertex. Using Boolean circuits of prefix computation, odd-even merge, and some other parallel techniques, we present an improved Boolean circuit for the same problem in O(log$^2$ n &middot; (log b + log log n)) depth and O(bn$^2$ log n) size.
Exploratory Movement Parameters Vary with Stimulus Stiffness
Authors: Lukas Kaim, Knut Drewing
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This study investigates the influence of stimulus properties on explorative movement parameters in active touch. Using a PHANToM force-feedback device we generated virtual stimuli with different stiffness values. Participants freely explored pair-wise presented stimuli and were asked to select the softer one. Afterwards we analyzed their explorative movements considering the parameters velocity, pressure and the indentation depth. We found a systematic influence of stimulus' stiffness on pressure/indentation depth and velocity. We conclude that observers adapted the movement parameters depending on stiffness variations.
Integrating Portfolio Management and Simulation Concepts in the ERP Project Estimation Practice
Authors: Maya Daneva
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

This paper presents a two-site case study on requirements-based effort estimation practices in enterprise resource planning projects. Specifically, the case study investigated the question of how to handle qualitative data and highly volatile values of project context characteristics. We counterpart this challenge and expound upon the integration of portfolio management concepts and simulation concepts into a classic effort estimation model (COCOMO II).
Mapping General-Specific Noun Relationships to WordNet Hypernym/Hyponym Relations
Authors: Gaël Dias, Raycho Mukelov, Guillaume Cleuziou
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

In this paper, we propose a new methodology based on directed graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora frequency counts. Different asymmetric association measures are implemented to build the graphs upon which the TextRank algorithm is applied and produces an ordered list of nouns from the most general to the most specific. Experiments are conducted based on the WordNet noun hierarchy and both quantitative and qualitative evaluations are proposed.
A Language Modelling Approach to Linking Criminal Styles with Offender Characteristics
Authors: Richard Bache, Fabio Crestani, David Canter, Donna Youngs
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

The ability to infer the characteristics of offenders from their criminal behaviour (`offender profiling') has only been partially successful since it has relied on subjective judgments based on limited data. Words and structured data used in crime descriptions recorded by the police relate to behavioural features. Thus Language Modelling was applied to an existing police archive to link behavioural features with significant characteristics of offenders. Both multinomial and multiple Bernoulli models were used. Although categories selected are gender and age group, in principle this can be applied to any characteristic recorded. Results indicate that statistically significant relationships exist between both age and sex in certain types of crime. Both types of language model perform with similar effectiveness. It is also possible to identify automatically specific terms which when taken together give insight into the style of offending related to a particular group.
The Role of Entropy: Mammogram Analysis
Authors: Sergio Vitulano, Andrea Casanova
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper introduces entropy as a feature for 1D signals. It proposes the ratio between signal perturbation (i.e. its part within minimum and maximum grey level) and the total signal energy as a measurement of entropy. Linear transformation of 2D signals into 1D signals is also illustrated together with the results. This paper also presents the experimentation carried out on different mammograms containing different pathologies (microcalcification and masses).A comparison between different entropy measures and ours is also illustrated in this study.
Inducing User Affect Recognition Models for Task-Oriented Environments
Authors: Sunyoung Lee, Scott W. Mcquiggan, James C. Lester
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Accurately recognizing users' affective states could contribute to more productive and enjoyable interactions, particularly for task-oriented learning environments. In addition to using physiological data, affect recognition models can leverage knowledge of task structure and user goals to effectively reason about users' affective states. In this paper we present an inductive approach to recognizing users' affective states based on appraisal theory, a motivational-affect account of cognition in which individuals' emotions are generated in response to their assessment of how their actions and events in the environment relate to their goals. Rather than manually creating the models, the models are learned from training sessions in which (1) physiological data, (2) information about users' goals and actions, and (3) environmental information are recorded from traces produced by users performing a range of tasks in a virtual environment. An empirical evaluation with a task-oriented learning environment testbed suggests that an inductive approach can learn accurate models and that appraisal-based models exploiting knowledge of task structure and user goals can outperform purely physiologically-based models.
Business intelligence solution for university management
Authors: Carlo Dell'aquila, Francesco Di Tria, Ezio Lefons, Filippo Tangorra
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Traditional users of data warehouses were banks, financial services, or chains of supermarkets. Instead, Institutional Organizations (e.g. Academies) in the past did not use the large amount of transactional data for strategic decision making. The optimal management of a University can now be considered as critical as the management of a big enterprise. In fact, the factors affecting the management of a University are the same involved in the business processes. The paper describes a proposal of the architecture of a Business Intelligence system and the flow of data processing for our University.
Pairs of bi-cubic surface constructions supporting polar connectivity
Authors: Ashish Myles, Kęstutis Karčiauskas, Jörg Peters
Venue: Computer Aided Geometric Design (2008)

Surface constructions of polynomial degree (3,3) come in four flavours that complement each other: one pair extends the subdivision paradigm, the other the NURBS patch approach to free-form modeling. The first pair, Catmull-Clark subdivision and Polar subdivision (Catmull, E., Clark, J., 1978. Recursively generated B-spline surfaces on arbitrary topological meshes. Computer Aided Design 10, 350-355; Karciauskas, K., Peters, J., 2007. Bicubic polar subdivision. ACM Trans. Graph. 26 (4), 14) generalize bi-cubic subdivision: While Catmull-Clark subdivision is more suitable where few facets join, Polar subdivision nicely models regions where many facets join as when capping extruded features. We show how to easily combine (the meshes of) these two generalizations of bi-cubic spline subdivision. The second pair of surface constructions with a finite number of patches consists of PCCM (Peters, J., 2000. Patching Catmull-Clark meshes. In: SIGGRAPH '00, ACM, pp. 255-258) for layouts where Catmull-Clark would apply and a singularly parameterized NURBS patch for polar layout. A novel analysis shows the latter to yield a C^1 surface with bounded curvatures.