ppxscal/embedding_network huggingface dataset:
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
Authors: Boris Aronov, Mark Berg, Shripad Thite
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of triangles in the terrain, we show the following two results.(i) If the triangles of the terrain have bounded slope and the projection of the set of triangles onto the xy-plane has low density, then the worst-case complexity of a bisector is ¿(n).(ii) If, in addition, the triangles have similar sizes and the domain of the terrain is a rectangle of bounded aspect ratio, then the worst-case complexity of the Voronoi diagram of m point sites is $\Theta(n+m\sqrt{n})$.
Efficient Continuous K-Nearest Neighbor Query Processing over Moving Objects with Uncertain Speed and Direction
Authors: Yuan-Ko Huang, Shi-Jei Liao, Chiang Lee
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

One of the important types of queries in spatio-temporal databases is the Continuous K-Nearest Neighbor (CKNN) query, which is to find among all moving objects the K-Nearest Neighbors (KNNs) of a mobile user at each time instant within a user-given time interval [t s , t e ]. In this paper, we focus on how to process such a CKNN query efficiently when the moving speed and direction of each moving object are uncertain. We thoroughly analyze the complicated problems incurred by this uncertainty and propose a Continuous PKNN (CPKNN) algorithm to effectively tackle these problems.
Global Oscillations of Neural Fields in CA3
Authors: Francesco Ventriglia
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

The investigation on the conditions which cause global population oscillatory activities in neural fields, originated some years ago with reference to a kinetic theory of neural systems, as been further deepened in this paper. In particular, the genesis of sharp waves and of some rhythmic activities, such as theta and gamma rhythms, of the hippocampal CA3 field, behaviorally important for their links to learning and memory, has been analyzed with more details. To this aim, the modeling-computational framework previously devised for the study of activities in large neural fields, has been enhanced in such a way that a greater number of biological features, extended dendritic trees---in particular, could be taken into account. By using that methodology, a two-dimensional model of the entire CA3 field has been described and its activity, as it results from the several external inputs impinging on it, has been simulated. As a consequence of these investigations, some hypotheses have been elaborated about the possible function of global oscillatory activities of neural populations of Hippocampus in engram formation. 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
Facial Sketching Based on Sub-Image Illumination Removal and Multiscale Edge Filtering
Authors: F. A. P. V. Arruda, V. A. Porto, H. M. Gomes, J. E. R. de Queiroz, N. Moroney
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

In this paper we introduce a method to automatically generate facial sketches from digital color photographs. First, the image is submitted to a sub-band homomorphic filtering for illumination compensation. Then, the result is fed into a multi-scale edge detection process. The homomorphic filter parameters and the optimal scales for the edge detector are acquired by means of a genetic algorithm optimization. An analysis comparing the results of the proposed method and those ones of a plain Canny edge detector is presented. The analysis has been performed considering manually labeled ground truth facial sketches and using three traditional evaluation metrics: Pratt’s Figure of Merit (FoM), Peak Signal to Noise Ratio (PSNR) and Structural SIMilarity (SSIM). Among all metrics, the Pratt’s FoM metric was the one with best stability. Parameter optimization using FoM rendered promising results to the proposed method. A subjective evaluation is also provided, which emphasizes the strengths of the proposed method.
The Impact of Information Communication Technologies (ICTs) on Diverse Students and Teachers at Second Level
Authors: Cara Nicole Greene
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper investigates the use of existing Information Communication Technologies (ICTs) by Irish secondary school teachers and students. Secondary Schools in Ireland are inclusive with a mix of students with diverse abilities in the classroom, including special needs students with learning and literacy difficulties, such as dyslexia. This papers looks at the use of three types of ICTs in particular: general-purpose ICTs such as word processors, focused special needs ICT tools like text-to-speech systems and online ICT curriculum-focused materials. Mainstream teachers and students and learning support teachers and students were surveyed on their use of ICT. They then undertook to use chosen tools for three months to complement their curricula and carry out software/tool reviews and evaluations. They then completed survey questionnaires on their usefulness and their impact on teaching and learning methods.
Measuring of Flickering Artifacts in Predictive Coded Video Sequences
Authors: Juergen Pandel
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

Flickering is one of the most annoying temporal artifacts in predictive video coding. It will frequently appear in particular within slow moving low textured objects when the encoder is forced to skip macroblocks in order to save data rate. A very simple no-reference metric is derived for automatic detection of temporal flickering artifacts resulting from such macroblock skipping. Tests are performed for different H.264 encoded video sequences.
Outlier Detection: An Approximate Reasoning Approach
Authors: Tuan Trung Nguyen
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Outliers, defined as data samples markedly different from the rest of their kind, play an important role in modern pattern recognition and data analysis systems. Outlier treatment usually invokes reasoning about the unknown (irregular) using concepts and features pertaining to the known (regular) samples, naturally requires tools for handling uncertainty or ambiguity, incorporates multi-layered approximate reasoning structures, and often relies on an external background knowledge source. Granular Computing and Rough Set theories provide excellent methods and frameworks for such tasks. In this article, we discuss methods for the detection and evaluation of outliers, as well as how to elicit background domain knowledge from outliers using multi-level approximate reasoning schemes.
Face Detection by Means of Skin Detection
Authors: Vitoantonio Bevilacqua, Giuseppe Filograno, Giuseppe Mastronardi
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this article we present a novel approach to detect face in color images. Many researchers concentrated on this problem and the literature about this subject is extremely wide. We thought to decompose the overall problem into two intuitive sub-problems: the research of pixels have skin color in the original image and the analysis of pixels portions resulting, by means of a neural classifier. The achieved results show the robustness of presented approach.
4th International Workshop on Model Driven Engineering, Verification, and Validation: Integrating Verification and Validation in MDE
Authors: Benoit Baudry, Alain Faivre, Sudipto Ghosh, Alexander Pretschner
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

Model Driven Engineering (MDE) approaches extensively use models and automatic model transformations to handle complex software development. A plethora of software artifacts, tools, environments and modeling languages need to be developed to make MDE a reality. Consequently, there is a crucial need for effective V V techniques in the context of MDE. Moreover, the novelty of MDE gives rise to questions concerning its impact on traditional V V techniques, and how they can leverage this new paradigm.
Assisting an Adolescent with Cerebral Palsy to Entry Text by Using the Chorded Keyboard
Authors: Yun-Lung Lin, Ming-Chung Chen, Chih-Ching Yeh, Yao-Ming Yeh, Hwa-Pey Wang
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

For people with severe motor disabilities, the utilization of a standard keyboard has been a challenge because of their motor limitations. This study aimed to design a chorded on-screen keyboard with a customized alternative input device to meet the needs of a client with cerebral palsy. A bilingual on-screen keyboard with Chinese and English input methods was designed especially for Chinese users. The intervention study revealed that the chorded on-screen keyboard with a customized alternative input device could significantly improve the text entry performance of the user and could efficiently be his communication tool. A deeper understanding on computer access through text entry was explored and better text entry training solutions were recommended for future researches.
Numerical method for a system of fourth-order boundary value problems
Authors: Tariq Aziz, Arshad Khan
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

In this paper we use sextic polynomial splines to derive some consistency relations which are then used to develop a numerical method for computing the solution for a system of fourth order boundary-value problems associated with obstacle, unilateral and contact problems. We show that a class of variational inequalities related to contact problems in elasto-statics can be characterized by a sequence of variational equations, which are solved using numerical method. For the purpose of numerical illustrations, we consider example of an elastic beam lying over an elastic obstacle. We have developed the boundary formulas of order four to restrict the band width of the coefficient matrix of the linear system to five. The numerical illustrations and comparison with other methods are given which shows the advantage of the present scheme.
Mono-and Crosslingual Retrieval Experiments with Spatial Restrictions at GeoCLEF 2007
Authors: Ralph Kölle, Ben Heuwing, Thomas Mandl, Christa Womser-Hacker
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The participation of the University of Hildesheim focused on the monolingual German and English tasks of GeoCLEF 2007. Based on the results of GeoCLEF 2005 and GeoCLEF 2006, the weighting and expansion of geographic Named Entities (NE) and Blind Relevance Feedback (BRF) were combined and an improved model for German Named Entity Recognition (NER) was evaluated. Post submission experiments are also presented.. A topic analysis revealed a wide spread of MAP values with high standard deviation values. Therefore further development will lie in the field of topic-adaptive systems.
Automated design of scoring rules by learning from examples
Authors: Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosenschein
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rules, as functions from preferences into candidates, is efficiently learnable in the PAC model. We discuss the applications of this result to automated design of scoring rules. We also investigate possible extensions of our approach, and (along the way) we establish a lemma of independent interest regarding the number of distinct scoring rules.
Novel Shape-From-Shading Methodology with Specular Reflectance Using Wavelet Networks
Authors: Lei Yang, Jiu-Qiang Han
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

This paper proposes a novel direct 3-D reconstruction methodology namely Shape-From-Shading with specular reflectance using wavelet networks. The thought of this approach is to optimize a proper reflectance model by learning the parameters of wavelet networks. Hybrid reflection models which contain diffuse reflectance and specular reflectance are used to formulate reflectance map equation because they are prone to reality. The approach uses wavelet networks as a parametric representation of the unknown surface to be reconstructed. After the orientation expressed by the parametric form of the surface is substituted into hybrid reflection model, the shape from shading problem is formulated as minimization of the total intensity error function over the network weights. Gradient-descent method is used to update the parameters of wavelet networks. The heights of the surface can then be obtained from the wavelet networks after supervised learning. Experiments on both synthetic and real images demonstrate the performance of the proposed SFS method.
Improving Classification with Pairwise Constraints: A Margin-Based Approach
Authors: Nam Nguyen, Rich Caruana
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

In this paper, we address the semi-supervised learning problem when there is a small amount of labeled data augmented with pairwise constraints indicating whether a pair of examples belongs to a same class or different classes. We introduce a discriminative learning approach that incorporates pairwise constraints into the conventional margin-based learning framework. We also present an efficient algorithm, PCSVM, to solve the pairwise constraint learning problem. Experiments with 15 data sets show that pairwise constraint information significantly increases the performance of classification.
Differences in Input Space Stability Between Using the Inverted Output of Amplifier and Negative Conductance for Inhibitory Synapse
Authors: Min-Jae Kang, Ho-Chan Kim, Wang-Cheol Song, Junghoon Lee, Hee-Sang Ko, Jacek M. Zurada
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In this paper, the difference between using the inverted neuron output and negative resistor for expressing inhibitory synapse is studied. We analyzed that the total conductance seen at the neuron input is different in these two methods. And this total conductance has been proved to effect on the system stability in this paper. Also, we proposed the method how to stabilize the input space and improve the system's performance by adjusting the input conductance between neuron input and ground. Pspice is used for circuit level simulation.
A distance-labelling problem for hypercubes
Authors: Sanming Zhou
Venue: Discrete Applied Mathematics (2008)

Let i"1>=i"2>=i"3>=1 be integers. An L(i"1,i"2,i"3)-labelling of a graph G=(V,E) is a mapping @f:V->{0,1,2,...} such that |@f(u)-@f(v)|>=i"t for any u,v@?V with d(u,v)=t, t=1,2,3, where d(u,v) is the distance in G between u and v. The integer @f(v) is called the label assigned to v under @f, and the difference between the largest and the smallest labels is called the span of @f. The problem of finding the minimum span, @l"i"""1","i"""2","i"""3(G), over all L(i"1,i"2,i"3)-labellings of G arose from channel assignment in cellular communication systems, and the related problem of finding the minimum number of labels used in an L(i"1,i"2,i"3)-labelling was originated from recent studies on the scalability of optical networks. In this paper we study the L(i"1,i"2,i"3)-labelling problem for hypercubes Q"d (d>=3) and obtain upper and lower bounds on @l"i"""1","i"""2","i"""3(Q"d) for any (i"1,i"2,i"3).
A Software and System Modeling Facility for Vehicle Environment Interactions
Authors: Edward Nelson, Henry Huang
Venue: Model-Driven Development of Reliable Automotive Services: Second Automotive Software Workshop, ASWSD 2006, San Diego, CA, USA, March 15-17, 2006, Revised Selected Papers (2006)

This paper describes an advanced modeling facility for system and software design that is being constructed at the Ford Research and Innovation Center. This facility is intended to address the growing complexity of automotive embedded software and the resulting issues for vehicle development. Software complexity is expected to grow at a significantly higher rate in the near future as vehicle systems begin to interact with external software based systems to provide significant new capabilities in both the infotainment and the safety areas. Increased complexity will require a broader range of modeling capabilities than just functional/behavioral modeling. Our recent experience with the latter has shown substantial benefits for the product development process, and we expect that the more comprehensive modeling process described here will bring even greater benefits.
Using Indexed Finite Set Variables for Set Bounds Propagation
Authors: Ruben Duarte Viegas, Marco Correia, Pedro Barahona, Francisco Azevedo
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

Constraint Programming (CP) has been successfully applied to numerous combinatorial problems such as scheduling, graph coloring, circuit analysis, or DNA sequencing. Following the success of CP over traditional domains, set variables were also introduced to more declaratively solve a number of different problems.Using a bounds representation for a finite set variable allows one to compactly represent the solution set of a set constraint problem. Many consistency mechanisms for maintaining bounds consistency have been proposed and in this paper we propose to use delta domain variable information to speed up constraint propagation. Additionally, we propose the use of indexed set domain variable representations as a better means of improving the use, intuitiveness and efficiency of delta domain variables for propagation tasks.
Effective Site Customization Based on Web Semantics and Usage Mining
Authors: Paraskevi Tzekou, Sofia Stamou, Lefteris Kozanidis, Nikos Zotos
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The explosive growth of online data and the diversity of goals that may be pursued over the web have significantly increased the monetary value of the web traffic. To tap into this accelerating market, web site operators try to increase their traffic by customizing their sites to the needs of specific users. Web site customization involves two great challenges: the effective identification of the user interests and the encapsulation of those interests into the sites' presentation and content. In this paper, we study how we can effectively detect the user interests that are hidden behind navigational patterns and we introduce a novel recommendation mechanism that employs web mining techniques for correlating the identified interests to the sites’ semantic content, in order to customize them to specific users. Our experimental evaluation shows that the user interests can be accurately detected from their navigational behavior and that our recommendation mechanism, which uses the identified interests, yields significant improvements in the sites' usability.
On the Complexity of Optimal Hotlink Assignment
Authors: Tobias Jacobs
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

The concept of hotlink assignment aims at reducing the navigation effort for users of a web directory or similar structure by inserting a limited number of additional hyperlinks called hotlinks. Given an access probability distribution of the leaves of the tree representing the web site, the goal of hotlink assignment algorithms is to minimize the expected path length between the root and the leaves.We prove that this optimization problem is NP-hard, even if only one outgoing hotlink is allowed for each node. This answers a question that has been open since the first formulation of the problem in [3].In this work we also investigate the model where hotlinks are only allowed to point at the leaves of the tree. We demonstrate that for this model optimal solutions can be computed in polynomial time. Our algorithm operates in a very general setting, where the maximum number of outgoing hotlinks is specified individually for each node. Experimental evaluation shows that the algorithm is applicable in practice.
Integrated hardware/software approaches to software security for embedded systems
Authors: Bhagirath Narahari, Rahul Simha
Venue:  (2008)

Software security remains a daunting problem and introduces even more challenges in the context of embedded systems. Their small size and pervasive use makes them vulnerable to physical attacks which can be launched after capture by an adversary and can defeat the typical security mechanisms, for remote network-based attacks. This thesis addresses the problem of protecting embedded software systems from physical attacks. Our research focuses on systems in which instructions and data are encrypted in memory and decrypted in the processor to minimize exposure to hardware sniffing or information leakage. However, several attacks on application code and data are still possible on such systems when the attacker has physical access to the system. Past approaches to this problem have provided hardware solutions, which require changes to the processor micro-architecture and the instruction set architecture. We propose an integrated hardware and software approach which requires no such changes. We design and combine novel techniques in the areas of compilers, architectures, and software security to provide a high level of security and user transparency. The architectural innovation stems from the use of an on-chip secure hardware component to implement our run-time security measures. For this purpose use an on-chip Field Programmable Gate Array (FPGA), an architecture that is now commonly available on many processor chips. By implementing all our security primitives on the FPGA we do not require any changes to the processor micro-architecture, the ISA or the memory organization. In our approach, a compiler-based software tool instruments executables and an on-chip FPGA-based hardware component provides run-time integrity and authorization checking on the executable code and application data. The use of an FPGA provides security services in a platform-independent manner and enables us to carry out application-specific compiler-driven protections. The compiler provides user transparency by hiding security details from software developers. We provide a cycle-accurate architecture simulator infrastructure to implement our techniques and to evaluate the performance impact of our approach. The low performance penalties, for high levels of code and data security, observed in our experimental results validate our approach.