ppxscal/embedding_network huggingface dataset:
Backpropagation through Time for Learning of Interconnected Neural Networks -- Identification of Complex Systems
Authors: Jaroslaw Drapala, Jerzy Swiatek
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Neural networks are mainly employed to model complex systems behavior. This work aims at broadening area of their applications to input-output dynamic complex systems of cascade structure. Each element of the complex system is modeled by a multi-input, multi-output recurrent neural network. A model of the whole system is obtained by composing all neural networks into one global network. Main contribution of this work is generalization of Back propagation Through Time method to complex systems modeled by interconnected neural networks. Appropriate algorithm is provided and numerical simulations are performed.
Aondê: An ontology Web service for interoperability across biodiversity applications
Authors: Jaudete Daltio, Claudia Bauzer Medeiros
Venue: Information Systems (2008)

Biodiversity research requires associating data about living beings and their habitats, constructing sophisticated models and correlating all kinds of information. Data handled are inherently heterogeneous, being provided by distinct (and distributed) research groups, which collect these data using different vocabularies, assumptions, methodologies and goals, and under varying spatio-temporal frames. Ontologies are being adopted as one of the means to alleviate these heterogeneity problems, thus helping cooperation among researchers. While ontology toolkits offer a wide range of operations, they are self-contained and cannot be accessed by external applications. Thus, the many proposals for adopting ontologies to enhance interoperability in application development are either based on the use of ontology servers or of ontology frameworks. The latter support many functions, but impose application recoding whenever ontologies change, whereas the first supports ontology evolution, but for a limited set of functions. This paper presents Aonde-a Web service geared towards the biodiversity domain that combines the advantages of frameworks and servers, supporting ontology sharing and management on the Web. By clearly separating storage concerns from semantic issues, the service provides independence between ontology evolution and the applications that need them. The service provides a wide range of basic operations to create, store, manage, analyze and integrate multiple ontologies. These operations can be repeatedly invoked by client applications to construct more complex manipulations. Aonde has been validated for real biodiversity case studies.
Mobility Impaired Pedestrians Are Not Cars: Requirements for the Annotation of Geographical Data
Authors: Thorsten Völkel, Romina Kühn, Gerhard Weber
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Mobility is one prerequisite for carrying out an autonomous and independent life. As mobility impaired pedestrians impose very heterogeneous requirements regarding the calculation of optimized routes and the provision of navigation instructions, currently available navigation systems do not offer sufficient support. The main drawback is due to inadequate map data which is mostly optimized for car navigation. To overcome these limitations, the technique of multimodal annotation of geographical data has been developed for which additional requirements have been gathered by conducting a survey including 88 visually impaired respondents. Within this paper, the results of the survey are presented. Requirements for multimodal annotation are derived and discussed.
Trends and Challenges in Algorithmic Software Verification
Authors: Rajeev Alur
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

Recent years have witnessed remarkable progress in principles and tools for automated software verification. In this position paper, I briefly discuss the relevant projects in my group, and outline some near-term challenges for the community as concrete milestones for measuring progress.
Factors that enhance customer trust in e-commerce web sites: an examination of e-commerce success metrics using internet audience rating
Authors: Raj Singh
Venue:  (2008)

As electronic commerce develops, its success critically depends on establishing, maintaining, and managing customer trust in e-commerce Web sites. The goal of this dissertation is to identify critical success factors that enhance customer trust in e-commerce Web sites and examine those factors in relation to the e-commerce success metrics using an Internet audience measurement tool. This study shows that a considerable number of functional factors, infrastructure factors, security factors, and organizational factors in Web design have significant positive impact on the success of e-commerce Web sites. In other words, it is worthwhile for organizations to use their resources by concentrating on critical success factor for customer trust in all four categories, functional, organizational, security, and infrastructure, not by expending a large amount of effort on minor design elements. The problem of trust was studied in the context of e-commerce Web site design. A four round Delphi study was conducted to address this problem. The Delphi study output was used to create a survey instrument, which employed a taxonomy of success factors that enhance customer trust in e-commerce Web sites. The data collected were correlated against Internet usage success metrics data provided by a well-known Internet Audience Rating Institution. Finally, a list of success factors for customer trust in e-commerce Web site was developed and tested for various hypotheses. The analysis and the solution proposed in this study could help information systems (IS) professionals to avoid many Web design failures and create successful Web sites efficiently using the identified factors that enhance customer trust in e-commerce.
US&R: A New Framework for Redoing
Authors: J. S. vitter
Venue: IEEE Software (1984)

Undo, Skip, & Redo-a new interactive approach to user recovery offers significant advantages over current undo/redo packages.
Identification of frequency of a shifted sinusoidal signal
Authors: S. V. Aranovskii, A. A. Bobtsov, A. S. Kremlev, G. V. Luk'Yanova, N. A. Nikolaev
Venue: Automation and Remote Control (2008)

The article deals with the issue of identification of an unknown frequency of a shifted sinusoidal signal y(t) = ¿ 0 + ¿ sin(¿t + ¿). A new approach taken to estimate the frequency of a shifted sinusoidal signal is suggested, which is a robust approach relative to undetermined disturbances present in the measurement of a useful signal. In contrast to known analogs, the given approach permits controlling the time of estimation of the unknown frequency ¿. The dimension of the identification algorithm suggested is less than that of known analogs.
Security Patterns and Secure Systems Design
Authors: Eduardo B. Fernandez
Venue: Proceedings of the 3rd Latin-American symposium on Dependable Computing (2007)

Analysis and design patterns are well established to build high-quality object-oriented software. Patterns combine experience and good practices to develop basic models that can be used for new designs. Security patterns join the extensive knowledge accumulated about security with the structure provided by patterns to provide guidelines for secure system design and evaluation. They are being adopted by companies such as IBM, Sun, and Microsoft. We show the anatomy of a security pattern, a variety of them, and their use in the construction of secure systems. These patterns include Authentication, Authorization, Role-based Access Control, Firewalls, Web Services Security (SAML, XACML, XML Firewall), and others. We apply these patterns through a secure system development method based on a hierarchical architecture whose layers define the scope of each security mechanism. First, the possible attacks are considered from an analysis of use cases. Then the rights of the users are defined from the use cases using a Role-Based Access Control (RBAC) or other security model. The attacks are used to define the policies that could stop them. The rights are reflected in the conceptual class model. We then define additional security constraints that apply to distribution, interfaces, and components. The patterns are shown using UML models and some examples are taken from my book "Security Patterns" (Wiley 2006).
A Visual Analytics Approach to Exploration of Large Amounts of Movement Data
Authors: Gennady Andrienko, Natalia Andrienko
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

Thanks to the recent progress in positioning and tracking technologies, data about various mobile objects or agents are currently collected in growing amounts. Analysis of such data can yield valuable knowledge about the movement behaviors of the objects and about the environment in which they move. Since movement data by themselves lack semantics (essentially, the records consist of coordinates and time stamps), their analysis requires the involvement of a human expert, who can interpret the data on the basis of his/her knowledge. This includes the general knowledge of the (geographic) space, time, and movement as well as territory- and domain-specific knowledge.
In Search of Proper Pareto-optimal Solutions Using Multi-objective Evolutionary Algorithms
Authors: Pradyumn Kumar Shukla
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

There are multiple solution concepts in multi-objective optimization among which a decision maker has to select some good solutions usually which satisfy some trade-off criteria's. The need for potentially good solutions has always been one of the primary aims in multi-objective optimization. A complete representation of all these solutions is only possible with population based approaches like multi-objective evolutionary algorithms since then trade-off's can be calculated at each generation from the population members. Thus this paper proposes the use of multi-objective evolutionary algorithms for obtaining a complete representation of these good solutions. Theoretical results show how one can integrate search procedure for obtaining these solutions in population based evolutionary algorithms and some convergence results. Finally simulation results are presented on a number of test problems.
Integrative Simulation of Work Processes
Authors: B. Kausch, N. Schneider, S. Tackenberg, C. Schlick, H. Luczak
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

The design and optimization of creative and communicative work processes requires a detailed analysis of necessary activities, organizational structure, and information flow as well as the identification of weak spots. These requirements are met by the C3 modeling technique, which was specifically developed for design processes in chemical engineering (cf. Subsect. 2.4.4). C3 is also the foundation of the simulation-based quantitative organizational study described in this section. Therefore, a transformation technique from semi-formal models of work organizational dependencies into formal workflow models has been developed and implemented. The verified results of test-runs show the various fields of application of this technique, including its benefits for the reduction of cycle times, for the optimization of the operating grade of the employees, and for the capacity utilization of tools and resources.
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
Authors: Jean-Claude Bermond, Min-Li Yu
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where the vertices represent the nodes and the edges, the possible communications. The interference constraint is modeled by a fixed integer d I ¿ 1, which implies that nodes within distance d I in the graph from one sender cannot receive messages from another node. In this paper, we suppose that it takes one unit of time (slot) to transmit a unit-length message. A step (or round) consists of a set of non interfering (compatible) calls and uses one slot. We present optimal algorithms that give minimum number of steps (delay) for the gathering problem with buffering possibility, when the network is a tree, the root is the destination and d I = 1. In fact we study the equivalent personalized broadcasting problem instead.
Cell Spreading Analysis with Directed Edge Profile-Guided Level Set Active Contours
Authors: Ilker Ersoy, Filiz Bunyak, Kannappan Palaniappan, Mingzhai Sun, Gabor Forgacs
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Cell adhesion and spreading within the extracellular matrix (ECM) plays an important role in cell motility, cell growth and tissue organization. Measuring cell spreading dynamics enables the investigation of cell mechanosensitivity to external mechanical stimuli, such as substrate rigidity. A common approach to measure cell spreading dynamics is to take time lapse images and quantify cell size and perimeter as a function of time. In our experiments, differences in cell characteristics between different treatments are subtle and require accurate measurements of cell parameters across a large population of cells to ensure an adequate sample size for statistical hypothesis testing. This paper presents a new approach to estimate accurate cell boundaries with complex shapes by applying a modified geodesic active contour level set method that directly utilizes the halo effect typically seen in phase contrast microscopy. Contour evolution is guided by edge profiles in a perpendicular direction to ensure convergence to the correct cell boundary. The proposed approach is tested on bovine aortic endothelial cell images under different treatments, and demonstrates accurate segmentation for a wide range of cell sizes and shapes compared to manual ground truth.
Internal Validation of Ancestral Gene Order Reconstruction in Angiosperm Phylogeny
Authors: David Sankoff, Chunfang Zheng, P. Kerr Wall, Claude Depamphilis, Jim Leebens-Mack, Victor A. Albert
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

Whole genome doubling (WGD), a frequent occurrence during the evolution of the angiopsperms, complicates ancestral gene order reconstruction due to the multiplicity of solutions to the genome halving process. Using the genome of a related species (the outgroup) to guide the halving of a WGD descendant attenuates this problem. We investigate a battery of techniques for further improvement, including an unbiased version of the guided genome halving algorithm, reference to two related genomes instead of only one to guide the reconstruction, use of draft genome sequences in contig form only, incorporation of incomplete sets of homology correspondences among the genomes and addition of large numbers of "singleton" correspondences. We make use of genomic distance, breakpoint reuse rate, dispersion of sets of alternate solutions and other means to evaluate these techniques, while reconstructing the pre-WGD ancestor of Populus trichocarpa as well as an early rosid ancestor.
Convergence of a Recurrent Neural Network for Nonconvex Optimization Based on an Augmented Lagrangian Function
Authors: Xiaolin Hu, Jun Wang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In the paper, a recurrent neural network based on an augmented Lagrangian function is proposed for seeking local minima of nonconvex optimization problems with inequality constraints. First, each equilibrium point of the neural network corresponds to a Karush-Kuhn-Tucker (KKT) point of the problem. Second, by appropriately choosing a control parameter, the neural network is asymptotically stable at those local minima satisfying some mild conditions. The latter property of the neural network is ensured by the convexification capability of the augmented Lagrangian function. The proposed scheme is inspired by many existing neural networks in the literature and can be regarded as an extension or improved version of them. A simulation example is discussed to illustrate the results.
Understanding and modeling pedestrian mobility of train-station scenarios
Authors: Mingmei Li, Shinichi Konomi, Kaoru Sezaki
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

This work presents the observations of pedestrian mobility characteristics based on the traces collected in a train station; provides a mobility model using these observations.
Comparison of Breast Percent Density Estimated from Digital Mammograms and Central Reconstructed Tomosynthesis Slice Images
Authors: Predrag R. Bakic, Despina Kontos, Andrea B. Troxel, Andrew Maidment
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

We analyzed breast percent density (PD) estimated from 35 women with existing or recently detected abnormalities. Analyzed were digital mammograms (DM) and the central digital breast tomosynthesis (DBT) reconstructed slices. PD was estimated from the breast contralateral to cancer. We have examined the effect of modifying the DBT reconstruction filter on the accuracy of dense tissue segmentation; we selected the filter that effectively reduced image intensity overshoot near the breast edge, which interfered with segmentation. The Pearson correlation coefficient between PD estimates from DM and the central reconstructed DBT slices was r = 0.90. The corresponding quadratic-weighted kappa coefficient was ¿ = 0.78, indicating substantial agreement. The observed results are comparable with the agreement between PD estimates from DM and the central DBT projection images (r = 0.89 and ¿ = 0.74). This suggests that PD is robust to variations in acquisition conditions.
Exploring Query Formulation and Reformulation: A Preliminary Study to Map Users' Search Behaviour
Authors: Anna Mastora, Maria Monopoli, Sarantos Kapidakis
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

This study aims to investigate the query formulation and reformulation patterns such as generalisations, specifications, parallel movements and replacements with synonyms within the search procedure. Results showed that users reformulated their queries by using terms contained in the retrieved results while in the query reformulation process they mainly used terms with parallel meanings. Participants used equally either more specific or more general terms for follow-up queries. Finally, the study revealed that a high proportion of same terms were used instead of unique ones; half of them were included in the Eurovoc thesaurus.
An Algebra for Features and Feature Composition
Authors: Sven Apel, Christian Lengauer, Bernhard Möller, Christian Kästner
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

Feature-Oriented Software Development (FOSD) provides a multitude of formalisms, methods, languages, and tools for building variable, customizable, and extensible software. Along different lines of research, different notions of a feature have been developed. Although these notions have similar goals, no common basis for evaluation, comparison, and integration exists. We present a feature algebra that captures the key ideas of feature orientation and provides a common ground for current and future research in this field, in which also alternative options can be explored.
Overhead elimination mechanisms in real-time systems
Authors: Ilhyun Lee, Haesun K. Lee, Narayan Debnath
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

The OEM (Overhead Elimination Mechanism), a scheduler for finding minimal overheads with reduced context switches in real-time systems, was developed using procedural methods. Software produced by these methods has often proven to be inflexible and difficult to modify or enhance. Because an object-oriented approach makes it easier to enhance the system, we will explore an object-oriented OEM, OOEM, in real-time environments. The OOEM (Object-oriented Overhead Elimination Mechanism) is the shift result from the transition from procedural approach to object-oriented approach and it will be a basis for building more dynamic real time environments such as aperiodic, BP, and sporadic. The operation, implementation, and performance of the OEM and OOEM will be presented. A comparison between our algorithms and other well-known algorithms in terms of context switches will also be shown. A valuable contribution of this research is to provide the real-time system designer with a wide range of alternative for reducing the complexity of system development and can lead higher quality system.
Atherosclerosis Risk Assessment using Rule-Based Approach
Authors: Petr Berka, Marie Tomecková
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

A number of calculators that compute the risk of atherosclerosis has been developed and made available on the Internet. They all are based on computing weighted sum of risk factors. We propose instead to use more flexible rule-based approach to estimate this risk. The used rules were created using machine learning methods and further refined by domain expert. Using our rule-based expert system NEST, we built a consultation module AtherEx, that helps (via Internet) a non-expert user to evaluate his atherosclerosis risk.
Analysis of Low Hamming Weight Products
Authors: Jung Hee Cheon, HongTae Kim
Venue: Discrete Applied Mathematics (2008)

Hoffstein and Silverman suggested a use of Low Hamming Weight Product (LHWP) to compute a random power in a group or a multiple of an element in a ring. It reduces the computation of powers in a group with fast endomorphisms such as the Galois field F"2"^"n and Koblitz elliptic curves. In this paper, we introduce a reduced representation of LHWP and apply them to attack the relevant cryptosystems.
SASyLF: an educational proof assistant for language theory
Authors: Jonathan Aldrich, Robert J. Simmons, Key Shin
Venue: Proceedings of the 2008 international workshop on Functional and declarative programming in education (2008)

Teaching and learning formal programming language theory is hard, in part because it's easy to make mistakes and hard to find them. Proof assistants can help check proofs, but their learning curve is too steep to use in most classes, and is a barrier to researchers too. In this paper we present SASyLF, an LF-based proof assistant specialized to checking theorems about programming languages and logics. SASyLF has a simple design philosophy: language and logic syntax, semantics, and meta-theory should be written as closely as possible to the way it is done on paper. We describe how we designed the SASyLF syntax to be accessible to students learning type theory, and how students can understand its semantics directly in terms of the theory they are taught in class. SASyLF can express proofs typical of an introductory graduate type theory course. SASyLF proofs are generally very explicit, but its built-in support for variable binding provides substitution properties for free and avoids awkward variable encodings. We describe preliminary experience teaching with SASyLF.