ppxscal/embedding_network huggingface dataset:
Support for Cooperative Design of End-User Tailorable Software
Authors: Jeanette Eriksson
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

Many contemporary business areas are dynamic and characterized by change. End-user tailorable software that allows the users to continue its evolution and adjustment is suitable in such environments. Unfortunately, the changes in the environment make it hard to know what flexibility to build into the software. The study presented here was aimed at providing an instrument that makes it possible to distinguish between different types of end-user tailoring, and to support discussions between users and developers concerning what kind of tailorability to build into the software. The study was performed in cooperation with a telecom company where tailorable software is essential to keep up with the fast changing market. The study resulted in ten attributes characterizing end-user tailorable software and a matrix capturing the values of the attributes. The matrix can be used as a guide and a basis for design decisions when implementing end-user tailorable software.
Training ANN for Image Discrimination Based on Wavelet
Authors: Ning Chen
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper introduced a technique for training ANN for image discrimination based on Wavelet. The technique models perception of human being as process of training ANN according to Visible Difference Predictors (VDPs). We used the Wavelet algorithm to acquire a training set, with ART-2 asrepresentative of ANN, which is considered a tradeoff of stability-plasticity dilemma. The experiments show an accuracy rate close to 80%.
Matching Problems in Polymatroids Without Double Circuits
Authors: Márton Makai, Gyula Pap, Jácint Szabó
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of certain substructures, called double circuits. In this paper we prove that if a polymatroid has no double circuits at all, then a partition-type min-max formula characterizes the size of a maximum matching. We provide applications of this result to parity constrained orientations and to a rigidity problem.A polynomial time algorithm is constructed by generalizing the principle of shrinking blossoms used in Edmonds' matching algorithm [2].
Oesophageal voice cycle detection in shimmer calculation algorithm
Authors: I. Ruiz, B. García, A. Méndez, M. Mendezona
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

This paper presents an algorithm which works with oesophageal voices in order to evaluate their quality by means of the automatic calculation of shimmer. The evaluation requires a novel and specific processing for the detection of the periodicity cycles and instants in order to calculate amplitude perturbations of vocal signals. The designed algorithm performs the calculus in an automatic way with a mean maximum inaccuracy of 0.46% for oesophageal voices which is a novelty and an advance if compared to the results obtained by algorithms used by scientific commercial software applications that implement this measure.
A Development Toolkit for Unified Web-Based User Interfaces
Authors: C. Doulgeraki, N. Partarakis, A. Mourouzis, C. Stephanidis
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

EAGER is a prototype development toolkit that allows embedding accessibility and ease of use for all potential users into Web-based artefacts. Web-based user interfaces developed by means of the EAGER toolkit incarnate the concept of Unified User Interfaces and exhibit adaptation behaviour with respect to diverse user abilities, requirements and preferences. Ultimately, the process of employing EAGER is significantly less demanding in terms of time, experience and skills required from the developer, than the typical process of developing for the "average" user.
Some Alternatives to Parikh Matrices Using String Kernels
Authors: Alexander Clark, Chris Watkins
Venue: Fundamenta Informaticae (2008)

We describe methods of representing strings as real valued vectors or matrices; we show how to integrate two separate lines of enquiry: string kernels, developed in machine learning, and Parikh matrices [8], which have been studied intensively over the last few years as a powerful tool in the study of combinatorics over words. In the field of machine learning, there is widespread use of string kernels, which use analogous mappings into high dimensional feature spaces based on the occurrences of subwords or factors. In this paper we show how one can use string kernels to construct two alternatives to Parikh matrices, that overcome some of the limitations of the Parikh matrix construction. These are morphisms from the free monoid to rings of real-valued matrices under multiplication: one is based on the subsequence kernel and the other on the gap-weighted string kernel. For the latter kernel we demonstrate that for many values of the gap-weight hyperparameter the resulting morphism is injective.
Extending CC-NUMA systems to support write update optimizations
Authors: Liqun Cheng, John B. Carter
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Processor stalls and protocol messages caused by coherence misses limit the performance of shared memory applications. Modern multiprocessors employ write-invalidate coherence protocols, which induce read misses to ensure consistency. Previous research has shown that an invalidate protocol is not optimal for all memory access patterns - an update protocol can significantly outperform an invalidate protocol when data is heavily shared or accessed in predictable patterns. However, update protocols can generate excessive network traffic and are difficult to build on a scalable (non-bus) interconnect. To obtain the benefits of both invalidate and update protocols, we built a speculative sequentially consistent write-update mechanism on top of a write-invalidate protocol. To ensure coherence, a processor wishing to write to a block of data uses a traditional write-invalidate protocol to obtain exclusive access to the block before modifying it. To improve performance, the writing processor can later self-downgrade the modified block to the shared state and flush it back to its home node, which forwards the new data to processors that it predicts are likely to consume the data. We present a practical and cost-effective design for extending CC-NUMA systems to support this speculative update mechanism that requires no changes to the processor core, bus interface, or memory consistency model. We also present two hardware-efficient mechanisms for detecting access patterns that benefit from the speculative update mechanism, stable reader set and stream. We evaluate our update mechanisms on a wide range of scientific benchmarks and commercial applications. Using a cycle-accurate execution-driven simulator of a future 16-node SGI multiprocessor, we find that the mechanisms proposed in this paper reduce the average remote miss rate by 30%, reduce network traffic by 15%, and improve performance by 10%, and in no case hurt performance.
Research on Advanced Distributed Learning by Using SCORM
Authors: Ronghui Wu, Renfa Li, Fei Yu, Guangxue Yue, Chen Xu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

The Sharable Content Object Reference Model (SCORM) was created to assist the e-learning industry in standardizing the best approaches to creating, storing, transferring and deploying learning content. The Advanced Distributed Learning Initiative(ADL) provides these guidelines consequent to a survey of authoring tools that support SCORM. In this paper, we us SCORM Sequencing Definition model to construct adaptive courseware. At first introduces the architecture of the whole system; Then introduces the way to build adaptive courseware, Finally gives a conclusion.
Information Flow Analysis in Autonomous Agent and Peer-to-Peer Systems for Self-organizing Electronic Health Records
Authors: Ben Tse, Raman Paranjape, Samuel R. Joseph
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

There are various software applications that are highly suited for development using agent technology. Typically these applications take advantage of some of the intrinsic qualities of agents that include: autonomy, reactivity/proactivity, group-action, and/or mobility. On the other hand, there are many parallels between Agent Systems and Peer-to-Peer Systems allowing the latter to be employed in similar problem domains. This paper presents an agent application in the health care record management domain and then examines how such a system might also be implemented as a Peer-to-Peer System. The management of health care records is in itself a novel use of Mobile Agent technology and in order to understand the Agent System Dynamics, the system is simulated using a limited number of agents and agent platforms; as well as being modeled mathematically. The Peer-to-Peer system is also simulated and modeled mathematically demonstrating a number of behaviors that are similar across both systems.
Data Quality in Privacy Preservation for Associative Classification
Authors: Nattapon Harnsamut, Juggapong Natwichai, Xingzhi Sun, Xue Li
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Privacy preserving has become an essential process for any data mining task. In general, data transformation is needed to ensure privacy preservation. Once the privacy is preserved, data quality issue must be addressed, i.e. the impact on data quality should be minimized. In this paper, k-Anonymization is considered as the transformation approach for preserving data privacy. In such a context, we discuss the metrics of the data quality in terms of classification, which is one of the most important tasks in data mining. Since different type of classification may use different approach to deliver knowledge, data quality metric for the classification task should be tailored to a certain type of classification. Specifically, we propose a frequency-based data quality metric to represent the data quality of the transformed dataset in the situation that associative classification is to be processed. Subsequently, we validate our proposed metric with experiments. The experiment results have shown that our proposed metric can effectively reflect the data quality for the associative classification problem.
A Hierarchical Data Structure for Representing the Spatial Decomposition of 3-D Objects
Authors: Ingrid Carlbom, Indranil Chakravarty, David Vanderschel
Venue: IEEE Computer Graphics and Applications (1985)

The polytree, a generalization of the octree data structure, retains most of the desirable features of the octree structure while offering several advantages.
Note: There exists no Steiner system S(4,5,17)
Authors: Patric R. J. Östergård, Olli Pottonen
Venue: Journal of Combinatorial Theory Series A (2008)

If a Steiner system S(4,5,17) exists, it would contain derived S(3,4,16) designs. By relying on a recent classification of the S(3,4,16), an exhaustive computer search for S(4,5,17) is carried out. The search shows that no S(4,5,17) exists, thereby ruling out the existence of Steiner systems S(t,t+1,t+13) for t>=4.
OplAnalyzer: A Toolbox for MALDI-TOF Mass Spectrometry Data Analysis
Authors: Thang V. Pham, Connie R. Jimenez
Venue: Proceedings of the 3rd international conference on Advances in Mass Data Analysis of Images and Signals in Medicine, Biotechnology, Chemistry and Food Industry (2008)

We present a software package for the analysis of MALDI-TOF mass spectrometry data. The software is designed to facilitate a complete exploratory workflow: pre-processing of raw spectral data, specification of study groups for comparison, statistical differential analysis, visualization of peptide peaks, and classification. The software supports various external tools for these tasks. We also pay special attention to the iterative nature of a typical analysis. Finally, we present two proteomics studies where the software has been used for data analysis.
Automatic Segmentation of Unstained Living Cells in Bright-Field Microscope Images
Authors: M. Tscherepanow, F. Zöllner, M. Hillebrand, F. Kummert
Venue: Proceedings of the 3rd international conference on Advances in Mass Data Analysis of Images and Signals in Medicine, Biotechnology, Chemistry and Food Industry (2008)

The automatic subcellular localisation of proteins in living cells is a critical step in determining their function. The evaluation of fluorescence images constitutes a common method of localising these proteins. For this, additional knowledge about the position of the considered cells within an image is required. In an automated system, it is advantageous to recognise these cells in bright-field microscope images taken in parallel with the regarded fluorescence micrographs. Unfortunately, currently available cell recognition methods are only of limited use within the context of protein localisation, since they frequently require microscopy techniques that enable images of higher contrast (e.g. phase contrast microscopy or additional dyes) or can only be employed with too low magnifications. Therefore, this article introduces a novel approach to the robust automatic recognition of unstained living cells in bright-field microscope images. Here, the focus is on the automatic segmentation of cells.
Digital Libraries in Central and Eastern Europe: Infrastructure Challenges for the New Europe
Authors: Christine L. Borgman, Tatjana Aparac-Jelušić, Sonja Pigac Ljubi, Zinaida Manžuch, György Sebestyén, András Gábor
Venue: Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries (2007)

The countries of Central and Eastern Europe (CEE) that were part of the Soviet Bloc or were non-aligned (Yugoslavia) entered the 1990s with telecommunications penetration of about fifteen telephones per hundred persons and a weak technical infrastructure based on pre-Cold War mechanical switching technology. They lacked digital transmission systems, fiber optics, microwave links, and automated systems control and maintenance. Until 1990, business, government, and education made little use of computers, although some mainframe-based data processing centers handled scientific and military applications. Communication technologies such as typewriters, photocopiers, and facsimile machines were registered and controlled to varying degrees in each country. The CEE countries could not legally make connections between their computer networks and those of countries outside the Soviet Bloc owing to the COCOM regulations and other embargoes imposed on the region by the West, although clandestine network connections were widely known to exist. In the fifteen-plus years since the collapse of the Soviet Bloc, these countries have made rapid advances in infrastructure and economics, and several already have become members of the European Union. Yet many challenges remain, especially with regard to infrastructure maturity, linguistics, and intellectual property.
Optimal determination of partial transmission ratios of three-step helical gearboxes with first and third-step double gear-sets for minimal mass of gears
Authors: Vu Ngoc Pi
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

This paper introduces a new study on the applications of the optimization and computer techniques for optimal determination of partial ratios of three-step helical gearboxes with first and third-step double gearsets for minimal mass of gears. In the study, from the condition of the moment equilibrium of a mechanic system including gear units and their regular resistance condition, models for prediction of the partial ratios of the gearboxes were proposed. Especially, explicit models for determination of the partial ratios are introduced by using regression analysis technique. Using these models, the prediction of the partial ratios becomes accurate and simple.
A Miniature Robot System with Fuzzy Wavelet Basis Neural Network Controller
Authors: Lianzhi Yu, Guozheng Yan, Chunyang Wang, Wenlong Yang, Peng Zan, Jie Wu
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper described the structure of a flexible miniature robot system which can move in human cavities, it makes inchworm-like movement driven by a 3-DOF pneumatic rubber actuator and holds its positions by air chambers. The driving characteristics in axial and bending directions of the actuator were analyzed and the robot control system was designed. The four-layer neural network and the five-layer neural network controllers were proposed to estimate the straight movement and the bending movement respectively. The tracking response and the tracking errors were studied in detail. Results prove that good static and dynamic control effects of the robot system can be obtained by the proposed fuzzy wavelet basis neural networks.
Lightweight monadic regions
Authors: Oleg Kiselyov, Chung-chieh Shan
Venue: Proceedings of the first ACM SIGPLAN symposium on Haskell (2008)

We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to close it. The libraries can be trivially extended to other resources such as database connections and graphic contexts. Because file handles and similar resources are scarce, we want to not just assure their safe use but further deallocate them soon after they are no longer needed. Relying on Fluet and Morrisett's [4] calculus of nested regions, we contribute a novel, improved, and extended implementation of the calculus in Haskell, with file handles as resources. Our library supports region polymorphism and implicit region subtyping, along with higher-order functions, mutable state, recursion, and run-time exceptions. A program may allocate arbitrarily many resources and dispose of them in any order, not necessarily LIFO. Region annotations are part of an expression's inferred type. Our new Haskell encoding of monadic regions as monad transformers needs no witness terms. It assures timely deallocation even when resources have markedly different lifetimes and the identity of the longest-living resource is determined only dynamically. For contrast, we also implement a Haskell library for manual resource management, where deallocation is explicit and safety is assured by a form of linear types. We implement the linear typing in Haskell with the help of phantom types and a parameterized monad to statically track the type-state of resources.
Bottleneck Detection in Parallel File Systems with Trace-Based Performance Monitoring
Authors: Julian M. Kunkel, Thomas Ludwig
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Today we recognize a high demand for powerful storage. In industry this issue is tackled either with large storage area networks, or by deploying parallel file systems on top of RAID systems or on smaller storage networks. The bigger the system gets the more important is the ability to analyze the performance and to identify bottlenecks in the architecture and the applications.We extended the performance monitor available in the parallel file system PVFS2 by including statistics of the server process and information of the system. Performance monitor data is available during runtime and the server process was modified to store this data in off-line traces suitable for post-mortem analysis. These values can be used to detect bottlenecks in the system. Some measured results demonstrate how these help to identify bottlenecks and may assists to rank the servers depending on their capabilities.
Fully-Simulatable Oblivious Set Transfer
Authors: Huafei Zhu
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

In this paper, a new notion which we call oblivious set transfer is introduced and formalized. An oblivious set transfer in essence, is an extension of the notions of oblivious bit transfer and oblivious string transfer protocols. The security of oblivious set transfer protocols is defined in the real/ideal world simulation paradigm. We show that oblivious set transfer protocols that are provably secure in the full simulation model can be efficiently implemented assuming the existence of semantically secure encryption schemes, perfectly hiding commitments and perfectly binding commitments.
Evolutionary Tool for the Incremental Design of Controllers for Collective Behaviors
Authors: Pilar Caamanño, Abraham Prieto, Jose Antonio Becerra, Richard Duro, Francisco Bellas
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

In this paper we present a software tool for the automatic design of collective behaviors in animated feature films. The most successful existing commercial solutions used in animation studios require an explicit knowledge by the designer of the AI or other techniques and involve the hand design of many parameters. Our main motivation consists in developing a design tool that permits creating the behaviors of the characters from a high level perspective, using general concepts related to the final desired objectives, and to judge these behaviors from a visual point of view, thus abstracting the designer from the computational techniques in the system core. In this case, a bioinspired approach has been followed consisting in the incremental generation of controllers for simulated agents using evolution. An example of flocking activity is created with the system.
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints
Authors: Hung Q. Ngo, Yang Wang, Anh Le
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

In an optical crossconnect architecture, two routes sharing a common switching element suffer from crosstalk. Vaez and Lea [16] introduced a parameter c which is the maximum number of distinct switching elements a route can share with other routes in the crossconnect. We present a new method of analyzing strictly nonblocking d-ary multilog networks under this general crosstalk constraint using linear programming duality.We improve known results on several fronts: (a) our sufficient conditions are better than known sufficient conditions for log d (N,0,m) to be nonblocking under the general crosstalk constraint, (b) our results are on d-ary multilog networks while known results are on binary networks, and (c) for several ranges of the parameter c, we give the first known necessary conditions for this problem which also match our sufficient conditions from the LP-duality approach.