ppxscal/embedding_network huggingface dataset:
An intelligent system for sorting pistachio nut varieties
Authors: Mahmoud Omid, Asghar Mahmoudi, Mohammad H. Omid
Venue: Expert Systems with Applications: An International Journal (2009)

An intelligent pistachio nut sorting system combining acoustic emissions analysis, Principal Component Analysis (PCA) and Multilayer Feedforward Neural Network (MFNN) classifier was developed and tested. To evaluate the performance of the system 3200 pistachio nuts from four native Iranian pistachio nut varieties were used. Each variety was consisted of 400 split-shells and 400 closed-shells nut. The nuts were randomly selected, slide down a chute, inclined 60^o above the horizontal, on which nuts slide down to impact a steel plate and their acoustic signals were recorded from the impact. Sound signals in the time-domain are saved for subsequent analysis. The method is based on feature generation by Fast Fourier Transform (FFT), feature reduction by PCA and classification by MFNN. Features such as amplitude, phase and power spectrum of sound signals are computed via a 1024-point FFT. By using PCA more than 98% reduction in the dimension of feature vector is achieved. To find the optimal MFNN classifier, various topologies each having different number of neurons in the hidden layer were designed and evaluated. The best MFNN model had a 40-12-4 structure, that is, a network having one hidden layer with 40 neurons at its input, 12 neurons in the hidden layer and 4 neurons (pistachio varieties) in the output layer. The selection of the optimal model was based on the examination of mean square error, correlation coefficient and correct separation rate (CSR). The CSR or total weighted average in system accuracy for the 40-12-4 structure was 97.5%, that is, only 2.5% of nuts were misclassified.
A user study of mobile web services and applications from the 2008 Beijing Oympics
Authors: Alvin Chin, Jyri P. Salomaa
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

This paper describes a business user study using a packaged suite of mobile Web services and applications deployed at a real-time event, the Beijing Olympic Games in August 2008. These applications were an Olympics guide, menu reader, phrasebook, Sports Tracker [3], photo sharing on Ovi [4], and Nokia Maps [2]. To evaluate its feasibility and use, we used logging, surveys, and statistical analysis for collecting and analyzing the data. We discovered that guests found the Olympics guide application to be the most popular, followed by Nokia Maps and then photo sharing on Ovi. The results demonstrate that the techniques used in our evaluation can be used to determine the type of applications that are relevant to consumers at a real-time event, and suggests ways for improving the mobile application design and user experience.
Internet Laboratory Instructions for Advanced Software Engineering Course
Authors: Ilona Bluemke, Anna Derezińska
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

In this paper a new software engineering laboratory introduced in the Institute of Computer Science Warsaw University of Technology in the fall 2004 is presented. Advanced Software Engineering 2 (SE-2) laboratory consists of seven exercises. Theses exercises are dedicated to requirements engineering, system design with UML [11], reuse, precise modelling with OCL --Object Constraint Language [12], code coverage testing, memory leaks detection and improving application efficiency. Six out of ten SWEBOK [4] knowledge areas are practiced. For each laboratory exercise a set of training materials and instructions were developed. These materials are stored on a department server and are available for all students and lecturers of advanced Software Engineering 2 (SE-2) course. Rational Suite tools are used in laboratory.
A sharp interface finite volume method for elliptic equations on Cartesian grids
Authors: M. Oevermann, C. Scharfenberg, R. Klein
Venue: Journal of Computational Physics (2009)

We present a second order sharp interface finite volume method for the solution of the three-dimensional elliptic equation @?.(@b(x->)@?u(x->))=f(x->) with variable coefficients on Cartesian grids. In particular, we focus on interface problems with discontinuities in the coefficient, the source term, the solution, and the fluxes across the interface. The method uses standard piecewise trilinear finite elements for normal cells and a double piecewise trilinear ansatz for the solution on cells intersected by the interface resulting always in a compact 27-point stencil. Singularities associated with vanishing partial volumes of intersected grid cells are removed by a two-term asymptotic approach. In contrast to the 2D method presented by two of the authors in [M. Oevermann, R. Klein, A Cartesian grid finite volume method for elliptic equations with variable coefficients and embedded interfaces, Journal of Computational Physics 219 (2006) 749-769] we use a minimization technique to determine the unknown coefficients of the double trilinear ansatz. This simplifies the treatment of the different cut-cell types and avoids additional special operations for degenerated interface topologies. The resulting set of linear equations has been solved with a BiCGSTAB solver preconditioned with an algebraic multigrid. In various testcases - including large @b-ratios and non-smooth interfaces - the method achieves second order of accuracy in the L"~ and L"2 norm.
A probabilistic analysis of diagnosability in discrete event systems
Authors: Farid Nouioua, Philippe Dague
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classical results of diagnosability: instead of giving a binary answer, the approach we propose allows one to quantify, in particular, the degree of non-diagnosability in case of negative answer. The dynamics of the system is modelled by a reducible Markov chain. A state of this chain contains information about whether it is faulty (resp. ambiguous) or not. The useful refinements of the decision about diagnosability are then obtained from the asymptotic analysis of this Markov chain. This analysis may be very useful in practice since it may lead to take the decision of tolerating some non-diagnosable systems, if their non-diagnosability is not critical, and thus allows one saving the cost of additional sensors necessary to make these systems diagnosable This work is part of DIAFORE project supported by ANR under grant ANR-05-PDIT-016-05.
Evaluation of inter-organizational business process solutions: A conceptual model-based approach
Authors: Johny Ghattas, Pnina Soffer
Venue: Information Systems Frontiers (2009)

Collaboration and coordination between organizations are necessary in today's business environment, and are enabled by inter-organizational processes. Many approaches for the construction of such processes have been proposed in recent years. However, due to the lack of standard terminology it is hard to evaluate and select a solution that fits a specific business scenario. The paper proposes a conceptual model which depicts the nature of interaction between organizations through business processes under specific business requirements that emphasize the privacy and autonomy of the participating organizations. The model is generic, and relies on the generic process model (GPM) framework and on Bunge's ontology. Being generic and theory-based, we propose to use the model as a basis for comparing and evaluating design and implementation-level approaches for inter-organizational processes. We demonstrate the evaluation procedure by applying it to three existing approaches.
Robust supervised classification with mixture models: Learning from data with uncertain labels
Authors: Charles Bouveyron, Stéphane Girard
Venue: Pattern Recognition (2009)

In the supervised classification framework, human supervision is required for labeling a set of learning data which are then used for building the classifier. However, in many applications, human supervision is either imprecise, difficult or expensive. In this paper, the problem of learning a supervised multi-class classifier from data with uncertain labels is considered and a model-based classification method is proposed to solve it. The idea of the proposed method is to confront an unsupervised modeling of the data with the supervised information carried by the labels of the learning data in order to detect inconsistencies. The method is able afterward to build a robust classifier taking into account the detected inconsistencies into the labels. Experiments on artificial and real data are provided to highlight the main features of the proposed method as well as an application to object recognition under weak supervision.
Governance of an agile software project
Authors: David Talby, Yael Dubinsky
Venue: Proceedings of the 2009 ICSE Workshop on Software Development Governance (2009)

Effective governance of agile software teams is challenging but required to enable wide adoption of agile methodologies, in particular for large-scale projects. In this paper we apply a full lifecycle governance model to agile projects, focused on the iteration level. The concept is demonstrated via a case study of a large-scale, enterprise-critical software project that implemented agile practices. We analyze three governance events, including the metrics that triggered the event, the decisions taken and the followup to ensure resolution. We conclude that governance iterations can be naturally unified with agile development iterations, resulting in a lean governance mechanism that identifies and resolves issues in an effective and timely manner.
Security mechanisms for mobile ad hoc and wireless sensor networks
Authors: Dharma P. Agrawal
Venue:  (2008)

Wireless Ad Hoc Networks have emerged as an advanced networking paradigm based on collaborative efforts among multiple self-organized wireless communication devices. Without the requirement of a fixed infrastructure support, wireless ad hoc networks can be quickly deployed anywhere at any time when needed. The decentralized nature, minimal configuration and quick deployment of wireless ad hoc networks make them suitable for various applications, from disaster rescue, target tracking to military conflicts. Wireless ad hoc networks can be further categorized into mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), and wireless mesh networks (WMNs) depending on their applications.Security is a big challenge in wireless ad hoc networks due to the lack of any infrastructure support, dynamic network topology, shared radio medium, and resource-constrained wireless users. Most existing security mechanisms applied for the Internet or traditional wireless networks are neither applicable nor suitable for wireless ad hoc network environments. In MANETs, routing security is an extremely important issue, as the majority of the standard routing protocols assume non-hostile environments. Once deployed in a hostile environment and working in an unattended mode, existing routing protocols are vulnerable to various attacks. To address these concerns, we propose an anonymous secure routing protocol for MANETs in this dissertation, which can be incorporated with existing routing protocols and achieve enhanced routing security with minimum additional overheads.In WSNs, key distribution and management is the core issue of any security approaches. Due to extremely resource-constrained sensor nodes and lack of any infrastructure support, traditional public-key based key distribution and management mechanisms are commonly considered as too expensive to be employed in WSNs. In this dissertation, we propose two efficient pairwise key pre-distribution and management mechanisms for both distributed and hierarchical large-scale WSNs, which enable establishing secure links between any two sensor nodes located within their communication range. As we know, sensing and communication are two fundamental characteristics of WSNs, and they cannot be addressed separately. Existing work on sensing coverage mainly focus on how to use the minimum number of sensors to achieve a required coverage, while security constraints are not sufficiently addressed. We propose an effective key distribution approach for randomly deployed WSNs, based on random graph theory and a realistic random key pre-distribution mechanism, in order to achieve both robust sensing coverage and secure connectivity simultaneously in a hostile deployment environment.
FUNEUS: A Neurofuzzy Approach Based on Fuzzy Adaline Neurons
Authors: Constantinos Koutsojannis, Ioannis Hatzilygeroudis
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

Today hybrid computing is a popular framework for solving complex problems. If we have knowledge expressed in rules, we can build an Expert System, and if we have data, or can learn from stimulation (training) then we can use Artificial Neural Networks. In this paper we present the FUzzy NEUrule System (FUNEUS) which is a Neuro Fuzzy approach based on fuzzy Adaline neurons and uses Differential Evolution for optimization of membership functions. According to previous Neuro-fuzzy approaches and a well-defined hybrid system HYMES, FUNEUS is an attempt to the direction for integration of neural and fuzzy components with Differential evolution. Despite the fact that it remains difficult to compare neurofuzzy systems conceptually and evaluate their performance, early experimental results proved a promising performance and the need for further evaluation in other application domains.
Multi-locus match probability in a finite population
Authors: Anand Bhaskar, Yun S. Song
Venue: Bioinformatics (2009)

Motivation: A fundamental problem in population genetics, which being also of importance to forensic science, is to compute the match probability (MP) that two individuals randomly chosen from a population have identical alleles at a collection of loci. At present, 11–13 unlinked autosomal microsatellite loci are typed for forensic use. In a finite population, the genealogical relationships of individuals can create statistical non-independence of alleles at unlinked loci. However, the so-called product rule, which is used in courts in the USA, computes the MP for multiple unlinked loci by assuming statistical independence, multiplying the one-locus MPs at those loci. Analytically testing the accuracy of the product rule for more than five loci has hitherto remained an open problem. Results: In this article, we adopt a flexible graphical framework to compute multi-locus MPs analytically. We consider two standard models of random mating, namely the Wright–Fisher (WF) and Moran models. We succeed in computing haplotypic MPs for up to 10 loci in the WF model, and up to 13 loci in the Moran model. For a finite population and a large number of loci, we show that the MPs predicted by the product rule are highly sensitive to mutation rates in the range of interest, while the true MPs computed using our graphical framework are not. Furthermore, we show that the WF and Moran models may produce drastically different MPs for a finite population, and that this difference grows with the number of loci and mutation rates. Although the two models converge to the same coalescent or diffusion limit, in which the population size approaches infinity, we demonstrate that, when multiple loci are considered, the rate of convergence in the Moran model is significantly slower than that in the WF model. Availability: A C++ implementation of the algorithms discussed in this article is available at http://www.cs.berkeley.edu/~yss/software.html. Contact: yss@eecs.berkeley.edu
Secure processing using dynamic partial reconfiguration
Authors: Christopher T. Rathgeb, Gregory D. Peterson
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

A popular research topic as of late has been dynamic partial FPGA (Field Programmable Gate Array) reconfiguration. This concept allows on-the-fly reconfiguration of digital systems where only parts of the circuit change, providing application acceleration and allowing static modules to continue processing unaffected by the dynamic elements. Design characteristics which benefit from this progressive approach include increased system flexibility, increased performance, and a reduction in circuit complexity. One characteristic receiving limited focus thus far has been the increased security that could result from these changing circuits. This benefit is innate to the design and makes reverse engineering of the system a much more ambitious task. In an effort to further enhance this passive security feature, a new partial reconfiguration technique has been proposed that changes connectivity between generic modules. This extended abstract introduces the method, model, and design flow for this dynamic partial FPGA reconfiguration technique and addresses the security implications of such a design.
Adobe Creative Suite 3 Bible
Authors: Ted Padova, Kelly L. Murdock
Venue:  (2007)

This is one of the few books to cover integration and workflow in depth between Photoshop, Illustrator, InDesign, GoLive, Acrobat, and Version Cue Graphic design firms, ad agencies, and publishing houses typically use a collection of programs to build their designs for print or the Web, and this book shows readers how to effectively manage that workflow among applications Provides solutions for issues that working designers or design students face every day, including developing consistent color-managed workflows, moving files among the CS3 applications, preparing files for print or the Web, repurposing documents, using CS3 with Office documents, and more
Tubular Anisotropy Segmentation
Authors: Fethallah Benmansour, Laurent D. Cohen
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

In this paper we present a new interactive method for tubular structure extraction. The main application and motivation for this work is vessel tracking in 2D and 3D images. The basic tools are minimal paths solved using the fast marching algorithm. This allows interactive tools for the physician by clicking on a small number of points in order to obtain a minimal path between two points or a set of paths in the case of a tree structure. Our method is based on a variant of the minimal path method that models the vessel as a centerline and surface. This is done by adding one dimension for the local radius around the centerline. The crucial step of our method is the definition of the local metrics to minimize. We have chosen to exploit the tubular structure of the vessels one wants to extract to built an anisotropic metric giving higher speed on the center of the vessels and also when the minimal path tangent is coherent with the vessel's direction. This measure is required to be robust against the disturbance introduced by noise or adjacent structures with intensity similar to the target vessel. We obtain promising results on noisy synthetic and real 2D and 3D images.
Fostering inclusion in Portuguese schools: key lessons from ICT projects
Authors: Maria João Silva, Eduarda Ferreira, Cristina Azevedo Gomes
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

This paper reports on different projects aimed at fostering inclusion in Portuguese elementary and high schools at national, regional and local level through ICT projects. Based on our participation in these projects, we describe the key lessons learned as regards using mobile technology, georeferenced information as well as children's and youngsters' interest and expertise in curricular activities. We argue that mobile technologies together with the creation and the publishing of multisensory georeferenced information can support educational engagement and inclusive participation in Portuguese school communities.
Beyond Output Voting: Detecting Compromised Replicas Using HMM-Based Behavioral Distance
Authors: Debin Gao, Michael K. Reiter, Dawn Song
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

Many host-based anomaly detection techniques have been proposed to detect code-injection attacks on servers. The vast majority, however, are susceptible to "mimicry” attacks in which the injected code masquerades as the original server software, including returning the correct service responses, while conducting its attack. "Behavioral distance,” by which two diverse replicas processing the same inputs are continually monitored to detect divergence in their low-level (system-call) behaviors and hence potentially the compromise of one of them, has been proposed for detecting mimicry attacks. In this paper, we present a novel approach to behavioral distance measurement using a new type of Hidden Markov Model, and present an architecture realizing this new approach. We evaluate the detection capability of this approach using synthetic workloads and recorded workloads of production web and game servers, and show that it detects intrusions with substantially greater accuracy than a prior proposal on measuring behavioral distance. We also detail the design and implementation of a new architecture, which takes advantage of virtualization to measure behavioral distance. We apply our architecture to implement intrusion-tolerant web and game servers, and through trace-driven simulations demonstrate that it experiences moderate performance costs even when thresholds are set to detect stealthy mimicry attacks.
A proposal for an Interactive Ontology Design Process based on Formal Concept Analysis
Authors: Rokia Bendaoud, Amedeo Napoli, Yannick Toussaint
Venue: Proceeding of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008) (2008)

Building a domain ontology usually requires several resources of different types, e.g. thesaurus, object taxonomies, terminologies, data-bases, sets of documents, etc. where objects are described in terms of attributes and relations with other objects. One important and hard problem is to be able to combine and merge knowledge units extracted from these different resources within the representation formalism supporting the ontology. The purpose of this paper is to show which kinds of resources can be taken as starting points for building an ontology, using FCA and its extension RCA. A real-world example in microbiology is proposed, detailing the interaction with domain experts during the ontology design process. Finally, an evaluation based on recall and precision gives an idea of the efficiency of the approach and points out several research perspectives.
Learning abstract concepts through bodily engagement: a comparative, qualitative study
Authors: Anja Hashagen, Corinne Büching, Heidi Schelhowe
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

The emergent discussion about embodiment offers new perspectives in Human-Computer-Interaction and needs further fundamental research in particular for its usefulness in the field of education. With our approach we want to use the concept to foster children's motivation to gain insight into the secrets of "intelligent" behavior of computer-generated artifacts. In this paper, our leading question is: Does bodily engagement support children in learning abstract models implemented through digital technologies better than through traditional software applications? We developed an installation Der Schwarm, which aims at motivating children to learn by whole body interaction as well as a learning software application Boids Regeln. We conducted and evaluated the study during a workshop with children aged 9-10 years. Finally we discuss the method and the results of this comparative, qualitative study.