ppxscal/embedding_network huggingface dataset:
Modularizing crosscuts in an e-commerce application in Lisp using HALO
Authors: Charlotte Herzeel, Kris Gybels, Pascal Costanza, Theo D'Hondt
Venue: Proceedings of the 2007 International Lisp Conference (2007)

Some program concerns cannot be cleanly modularized, and their implementation leads to code that is both hard to understand and maintain. In this paper we consider extending an e-commerce application, written in CLOS, with two of such crosscutting concerns. Though most of the time Common Lisp's macro facilities and CLOS' method combinations can be used to modularize crosscuts, we discuss the use of a more declarative solution when crosscuts depend on the execution history. For this purpose we give an overview of HALO, a novel pointcut language based on logic meta programming and temporal logic, which allows one to reason about program execution and (past) program state.
Color Harmonies and Contrasts Search in Art Image Collections
Authors: Krassimira Ivanova, Peter Stanchev
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

In this paper a novel and more complete classification of color harmonies and contrasts are presented. It is done on the base of the three main characteristics of the color, which are most closed to the human perception – hue, saturation and lightness. Functions for automatic features extraction from digital images, using MPEG-7 Dominant Color Descriptor are defined. The results of these functions are new high-level features vectors, corresponding to outline color combinations. An experimental software system was developed and experiments were conducted. The system can be used by designers and art students for searching images, having specific harmonies and contrasts in image collections. In future we will use the system as a Web 2.0 service, which could be included in a virtual learning environment.
Service View Description of a Service Oriented C4ISR Architecture Framework
Authors: Lei Wang, Ai-min Luo
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

This paper presents a Service Oriented C4ISR Architecture Framework and prescribes the Service View description. In the future integrated joint operation, similar to Network-Centric Operation, C4ISR system which enables to federate systems, sensors and effectors to promote military effectiveness, is moving towards a more dynamic producer/consumer environment. SOA is an architectural design approach to application integration that provides such an environment through the flexible connectivity of applications implemented as services. In order to improve the C4ISR Architecture Framework (C4ISRAF) including SOA related issues, service and related elements are added to the C4ISRAF as integrated parts and Service View is added to the framework. Further, Service View and its product descriptions are prescribed by the service related elements.
Improved affinity graph based multi-document summarization
Authors: Xiaojun Wan, Jianwu Yang
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

This paper describes an affinity graph based approach to multi-document summarization. We incorporate a diffusion process to acquire semantic relationships between sentences, and then compute information richness of sentences by a graph rank algorithm on differentiated intra-document links and inter-document links between sentences. A greedy algorithm is employed to impose diversity penalty on sentences and the sentences with both high information richness and high information novelty are chosen into the summary. Experimental results on task 2 of DUC 2002 and task 2 of DUC 2004 demonstrate that the proposed approach outperforms existing state-of-the-art systems.
A Combined Semantic and Motion Capture Database for Real-Time Sign Language Synthesis
Authors: Charly Awad, Nicolas Courty, Kyle Duarte, Thibaut Naour, Sylvie Gibet
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Over the past decade, motion capture data has become a popular research tool, and motion databases have grown exponentially. Indexing, querying, and retrieving data has thus become more difficult, and has necessitated innovative approaches to using these databases. Our aim is to make this approach feasible for virtual agents signing in French Sign Language (LSF), taking into account the semantic information implicitly contained in language data. We thus structure a database in two autonomous units, taking advantage of differing indexing methods within each. This allows us to effectively retrieve captured motions to produce LSF animations. We describe our methods for querying motion in the semantic database, computing transitory segments between concatenated signs, and producing realistic animations of a virtual LSF signer.
SimulSort: Multivariate Data Exploration through an Enhanced Sorting Technique
Authors: Inkyoung Hur, Ji Soo Yi
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Sorting is one of the well-understood and widely-used interaction techniques. Sorting has been adopted in many software applications and supports various cognitive tasks. However, when used in analyzing multi-attribute data in a table, sorting appears to be limited. When a table is sorted by a column, it rearranges the whole table, so the insights gained through the previous sorting arrangements of another column are often difficult to retain. Thus, this study proposed an alternative interaction technique, called "SimulSort." By sorting all of the columns simultaneously, SimulSort helps users see an overview of the data at a glance. Additional interaction techniques, such as highlighting and zooming, were also employed to alleviate the drawbacks of SimulSort. A within-subject controlled study with 15 participants was conducted to compare SimulSort and the typical sorting feature. The results showed typical sorting and SimulSort work with comparable efficiency and effectiveness for most of the tasks. Sorting more effectively supports understanding correlation and reading corresponding values, and SimulSort shows the potential to more effectively support tasks that need multi-attribute analyses. The implications of the results and planned future work are discussed as well.
Design and Implementation of Information Supporting System Model
Authors: Yang Juniang, Jiang Xiaoyuan, Li Zhanwei, Du Jia
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Information Supporting System is an important part of C4ISR. Analyzing and assessing the information supporting capability of Information Supporting System and its contribution to the war have become the important research topic. Based on making clear the concept of Information Supporting System, a capabilities-based simulation and modeling methodology is proposed. The methodology is used for modeling the information supporting capability. Then an Information Supporting System model, which can reflects the information supporting capability of Information Supporting System in different degrees at each development stage, is built up and implemented.
An inexact Newton method for nonconvex equality constrained optimization
Authors: Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
Venue: Mathematical Programming: Series A and B (2009)

We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For strictly convex problems, the method reduces to the inexact sequential quadratic programming approach proposed by Byrd et al. [SIAM J. Optim. 19(1) 351&#x2013;369, 2008]. For nonconvex problems, the methodology developed in this paper allows for the presence of negative curvature without requiring information about the inertia of the primal&#x2013;dual iteration matrix. Negative curvature may arise from second-order information of the problem functions, but in fact exact second derivatives are not required in the approach. The complete algorithm is characterized by its emphasis on sufficient reductions in a model of an exact penalty function. We analyze the global behavior of the algorithm and present numerical results on a collection of test problems.
Finite state automata and Arabic writing
Authors: Michel Fanton
Venue: Proceedings of the Workshop on Computational Approaches to Semitic Languages (1998)

Arabic writing has specific features, which imply computational overload for any arabicized software. Finite state automata are well known to give efficient solutions for translation problems which can be formalized as regular languages. These automata are as more easily built that their alphabet have been reduced through a careful linguistic analysis. This reduction makes it possible to write directly an automaton without going through the intermediate stage of contextual rules, which have to be translated into an automaton for the sake of efficiency. This paper presents two Moore automata, the first one, taken as an example, gives a solution to the choice of right shape for a letter to be printed or displayed (usually known as contextual analysis), the second one studies the more complex problem of determining the right carrying letter for hamza. Every arabicized software has to face these questions and finite state automata are certainly a good answer to them.
Hidden naive Bayes
Authors: Harry Zhang, Liangxiao Jiang, Jiang Su
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

The conditional independence assumption of naive Bayes essentially ignores attribute dependencies and is often violated. On the other hand, although a Bayesian network can represent arbitrary attribute dependencies, learning an optimal Bayesian network from data is intractable. The main reason is that learning the optimal structure of a Bayesian network is extremely time consuming. Thus, a Bayesian model without structure learning is desirable. In this paper, we propose a novel model, called hidden naive Bayes (HNB). In an HNB, a hidden parent is created for each attribute which combines the influences from all other attributes. We present an approach to creating hidden parents using the average of weighted one-dependence estimators. HNB inherits the structural simplicity of naive Bayes and can be easily learned without structure learning. We propose an algorithm for learning HNB based on conditional mutual information. We experimentally test HNB in terms of classification accuracy, using the 36 UCI data sets recommended by Weka (Witten & Frank 2000), and compare it to naive Bayes (Langley, Iba, & Thomas 1992), C4.5 (Quinlan 1993), SBC (Langley & Sage 1994), NBTree (Kohavi 1996), CL-TAN (Friedman, Geiger, & Goldszmidt 1997), and AODE (Webb, Boughton, & Wang 2005). The experimental results show that HNB outperforms naive Bayes, C4.5, SBC, NBTree, and CL-TAN, and is competitive with AODE.
On-Line Construction of Parameterized Suffix Trees
Authors: Taehyung Lee, Joong Chae Na, Kunsoo Park
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

We consider on-line construction of a suffix tree for a parameterized string, where we always have the suffix tree of the input string read so far. This situation often arises from source code management systems where, for example, a source code repository is gradually increasing in its size as users commit new codes into the repository day by day. We present an on-line algorithm which constructs a parameterized suffix tree in randomized O(n) time, where n is the length of the input string. Our algorithm is the first randomized linear time algorithm for the on-line construction problem.
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model
Authors: Guy Feigenblat, Ofra Itzhaki, Ely Porat
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

We consider the problem of estimating the frequency count of data stream elements under polynomial decay functions. In these settings every element arrives in the stream is assigned with a time decreasing weight, using a non increasing polynomial function. Decay functions are used in applications where older data is less significant \ interesting \ reliable than recent data. We propose 3 poly-logarithmic algorithms for the problem. The first one, deterministic, uses $ O (\frac{1}{\epsilon ^{2}} \log N ( \log \log N + \log U) ) $ bits. The second one, probabilistic, uses $O ( \frac{1}{\epsilon ^{2}} \log \frac{1}{\epsilon \delta} \log N )$ bits and the third one, deterministic in the stochastic model, uses $O(\frac{1}{\epsilon ^{2}} \log N)$ bits. In addition we show that using additional additive error can improve, in some cases, the space bounds. This variant of the problem is important and has many applications. To our knowledge it was never studied before.
Research on Credit Card Fraud Detection Model Based on Similar Coefficient Sum
Authors: ChunHua Ju, Na Wang
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

This paper analyses the causes that give rise to the risk of credit fraud and presents an anomaly detection method by using an outlier detection model based on similar coefficient sum. It finds fraud record by computing similar coefficient sum of every two objects and an example is given to validate the model. The result show the feasibility and validity of the method. The research work furnishes a basis for further study of applying outlier to the analysis and prediction of deception risks.
Introducing professional computing issues into the CS curriculum ACM committee on professional ethics
Authors: Don Gotterbarn, Keith Miller
Venue: Journal of Computing Sciences in Colleges (2009)

Computing professionals face ethical conflicts. A true professional faces these challenges intelligently and analytically. Professional practice consists of both technical knowledge and the skillful application of that knowledge guided by ethical standards. Computing professionals, like other professionals, must reason through tradeoffs between technical issues, legal issues, economic issues, stakeholder interests, and ethical principles.
ITU G.hn Concept and Home Automation
Authors: Manfred Schneps-Schneppe
Venue: Proceedings of the 9th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking and Second Conference on Smart Spaces (2009)

For long time, many in the buildings industry have been looking for a day when home automation systems would become fully integrated with communication and human-interface practices, with standards widely employed for information technology. Now the time is coming in the form of the ITU Recommendations G.hn.
Robust Watermarking Scheme Based on Singular Value of Decomposition in DWT Domain
Authors: Lijing Zhang, Aihua Li
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Digital watermarking is an effective way to protect copyright. Using the characteristics of discrete wavelet transform (DWT) and singular value decomposition (SVD)，a digital image watermarking algorithm based on DWT and SVD is proposed. The original image is transformed by DWT and SVD and the watermarking image is processed by Arnold transform and SVD. The watermarking image processed is embedded the original image decomposed.Then the image embedded by watermarking is gained through the corresponding transform．Tests show that the algorithm has a very high feasibility, and has a good robustness.
Three Kinds of Curves That Shape Can Adjust
Authors: JiongFeng Liang, LanLan Yan
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Three kinds of trigonometric bases are constructed in this paper. Based on these bases, three kinds of trigonometric spline curves with shape parameter are defined. As each piece of the curves is generated by three consecutive control points, they retain many properties of the quadratic B-spline curves, but they have higher order continuity than the quadratic B-spline curves. For equidistant knots, they have continuity under normal conditions, and they have continuity under special conditions. Besides, the curves are closer to the control polygon than the quadratic B-spline curves when the shape parameters under special conditions. In the last, the trigonometric spline surfaces with shape parameter are constructed. They have most properties of the corresponding trigonometric spline curves.
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Authors: Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We study the problem of packing element-disjoint Steiner trees in graphs. We are given a graph and a designated subset of terminal nodes, and the goal is to find a maximum cardinality set of element-disjoint trees such that each tree contains every terminal node. An element means a non-terminal node or an edge. (Thus, each non-terminal node and each edge must be in at most one of the trees.) We show that the problem is APX-hard when there are only three terminal nodes, thus answering an open question.Our main focus is on the special case when the graph is planar. We show that the problem of finding two element-disjoint Steiner trees in a planar graph is NP-hard. We design an algorithm for planar graphs that achieves an approximation guarantee close to 2. In fact, given a planar graph that is k element-connected on the terminals (k is an upper bound on the number of element-disjoint Steiner trees), the algorithm returns element-disjoint Steiner trees. Using this algorithm, we get an approximation algorithm for the edge-disjoint version of the problem on planar graphs that improves on the previous approximation guarantees. We also show that the natural LP relaxation of the planar problem has an integrality ratio approaching 2.
Succinct Representation of Codes with Applications to Testing
Authors: Elena Grigorescu, Tali Kaufman, Madhu Sudan
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

Motivated by questions in property testing, we search for linear error-correcting codes that have the "single local orbit" property: they are specified by a single local constraint and its translations under the symmetry group of the code. We show that the dual of every "sparse" binary code whose coordinates are indexed by elements of for prime n, and whose symmetry group includes the group of non-singular affine transformations of , has the single local orbit property. (A code is sparse if it contains polynomially many codewords in its block length.) In particular this class includes the dual-BCH codes for whose duals (BCH codes) simple bases were not known. Our result gives the first short (O(n)-bit, as opposed to $\exp(n)$-bit) description of a low-weight basis for BCH codes. If 2 n ¿ 1 is a Mersenne prime, then we get that every sparse cyclic code also has the single local orbit.
Hybrid AI Models for the Characterization of Oil and Gas Reservoirs: Concept, Design and Implementation
Authors: Fatai Anifowose
Venue:  (2009)

Oil and Gas remain the most exploited source of energy in the world today and have been predicted that they will continue to be available for exploitation in many decades to come. Hence, there is the need to develop accurate and robust predictive models for their effective and efficient exploration, exploitation and management to ensure consistent availability. Various Artificial Intelligence techniques have been used but with dire needs for improvement. Recently, hybrid schemes have been reported to offer better performance and reliability. The capabilities of these schemes have not been well utilized in Oil and Gas. This book explains how these schemes have been utilized in the prediction of porosity and permeability, two important indicators of oil and gas reserves, based on the hybridization of Type-2 Fuzzy Logic, Support Vector Machines and Functional Networks, using real-world well logs. The results are very promising. This book will be of great benefit to researchers and practitioners in the application of AI techniques in oil and gas as well as in Data Mining and Machine Learning. 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
An Analytical Way to Find Influencers on Social Networks and Validate their Effects in Disseminating Social Games
Authors: Erica Suyeon Kim, Steve Sangki Han
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

As the weight of online social networks (OSNs) which provide powerful means of sharing common interests and communicating has gradually grown up, influencers are also given the great attention. This research proposes and evaluates a methodology for discovering influencers within OSNs. Finding strong influencers out is momentous perspective in success of viral marketing.The methodology consists of two-step process. In step one, structural analysis, we extract the influencer candidate subgroup by the degree centrality computation based on the social graph. Next, we analyze each user’s activity history. After whole process, we finally obtain a few powerful influencers who can effectively affect other people than mediocrities.The positive effects of influencers are confirmed by analyzing the result of spreading social games out over Facebook. The results are compared with other game promotions without utilizing influencers.This methodology can be used in various marketing practices on social platforms.
UCD-S1: a hybrid model for detecting semantic relations between noun pairs in text
Authors: Cristina Butnariu, Tony Veale
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

We describe a supervised learning approach to categorizing inter-noun relations, based on Support Vector Machines, that builds a different classifier for each of seven semantic relations. Each model uses the same learning strategy, while a simple voting procedure based on five trained discriminators with various blends of features determines the final categorization. The features that characterize each of the noun pairs are a blend of lexical-semantic categories extracted from WordNet and several flavors of syntactic patterns extracted from various corpora, including Wikipedia and the WMTS corpus.
Efficient Authoring of SCORM Courseware Adapted to User Learning Style: The Case of ProPer SAT
Authors: Ioannis Kazanidis, Maya Satratzemi
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

Online courses are the most popular way to deliver knowledge for distance learning. New researches attempt to personalize the educational process with the use of the Adaptive Educational Hypermedia Systems. Moreover, due to the significant amount of time, money and effort devoted to creating online courses, developers strive to incorporate standards, such as SCORM, for the reusability, interoperability and durability of the educational content. However, it is a difficult task for teachers without programming knowledge to design and author adaptive courses. This work presents ProPer SAT, an authoring tool implemented for quick and easy SCORM courseware construction which can also be adapted to specific user learning styles.