ppxscal/embedding_network huggingface dataset:
Feature Extraction by Foley-Sammon Transform with Kernels
Authors: Zhenzhou Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

A method KFST (Foley-Sammon Transform with Kernels) is proposed which is based on FST (Foley-Sammon Transform) and kernel tricks. The projectors onto the directions derived by KFST can be used for class-specific feature extraction. The algorithm is carried out in a feature space associated with kernel functions, hence it can be used to construct a large class of nonlinear feature extractors. Linear feature extraction in feature space corresponds to nonlinear feature extraction in input space. KFST is proven to correspond to a generalized eigenvalue problem. Lastly, our method is applied to digits and images recognition problems, and the experimental results show that present method is superior to the existing methods in term of space distribution and correct classification rate.
Atomic Actions and Resource Coordination Problems Having Nonunique Solutions
Authors: M. K. Sinha
Venue: IEEE Transactions on Software Engineering (1985)

The concept of atomic actions is decomposed into database-dependent atomic actions and application-dependent atomic actions. There is a broad class of application-dependent atomic actions that can have nonunique solutions. These are resource coordination problems and are classified as problems of NU class. It is argued that a transaction modeling a problem of NU class provides lower concurrency. A concept of coordination is proposed which can model a broad range of NU class problems. An object model and a protocol are sugested which utilize the nonunique character of the solution to provide higher concurrency.
Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs
Authors: Kobi Inkumsah, Tao Xie
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Achieving high structural coverage such as branch coverage in object oriented programs is an important and yet challenging goal due to two main challenges. First, some branches involve complex program logics and generating tests to cover them requires deep knowledge of the program structure and semantics. Second, covering some branches requires special method sequences to lead the receiver object or non-primitive arguments to specific desirable states. Previous work has developed the concolic testing technique (a combination of concrete and symbolic testing techniques) and the evolutionary testing technique to address these two challenges, respectively. However, neither technique was designed to address both challenges at the same time. To address the respective weaknesses of these two previous techniques, we propose a novel framework called Evacon that integrates evolutionary testing (used to search for desirable method sequences) and concolic testing (used to generate desirable method arguments). We have implemented our framework and applied it on six classes taken from the Java standard library and basic data structures. The experimental results show that the tests generated using our framework can achieve higher branch coverage than evolutionary testing or concolic testing alone
A Dataflow Analysis for Mode Set Optimization in DSP Instruction Sets
Authors: Jiho Chu, Youngsun Han, Seon Wook Kim
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

A digital signal processor (DSP) has a specific architec- ture to process multimedia data very fast, but its complexity makes it difficult that a compiler generates highly optimized codes. A mode set problem is one of these difficulties. A mode set in DSP architectures provides extended function- alities to an instruction. The instruction performs differ- ently depending on the mode set. In this paper, we propose a code optimization technique to eliminate redundant mode set instructions. For our purpose, we introduce a dataflow analysis for the mode set optimization based on a control flow graph. The proposed algorithm guarantees that the dynamic number of mode set instructions is minimal. As an experiment, we applied our algorithm to a sign extension mode (SXM) in the Zaram compactDSP16 architecture, and we could eliminate redundant mode set instructions by 50% on average and up to 93% in our measured benchmarks.
Structural operational semantics for supporting multi-cycle operations in RTL HDLs
Authors: S. Zhao, D. D. Gajski
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

In this paper we formally define an operational semantics framework RTL++ for modeling behavioral RTL hardware IP. The semantics we define is neutral to existing HDLs and extends traditional sense RTL by natively supporting pipelined and multi-cycled operations with a unified register variable type. We believe this formalization help to guide the design of new HDLs or extensions of existing HDLs in terms of elevating RTL design abstraction level and also bridging the current HDL semantic gap among synthesis, simulation and formal verification tools. The intra-module and inter-module execution of RTL++ semantics are specified in Plotkin-style structural operational semantics framework. An example of implementing the RTL++ extension of SystemC is presented along with experimental results showing the benefit of modeling in RTL++.
A Vision for International Standardization in Software and Systems Engineering
Authors: Francois Coallier
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

The importance of standards in enabling the development of industry and commerce through the standardization of components, interfaces and specifications is well known and understood. As our societies move toward a post-industrial era, services' share of national economies and global commerce has increased. This article gives an introduction to international standardization in Information Technology. It also provides a status and describes current activities in international software and systems engineering standardization, and concludes with a vision of future activities in this area.
Using Biologically Inspired Features for Face Processing
Authors: Ethan Meyers, Lior Wolf
Venue: International Journal of Computer Vision (2008)

In this paper, we show that a new set of visual features, derived from a feed-forward model of the primate visual object recognition pathway proposed by Riesenhuber and Poggio (R P Model) (Nature Neurosci. 2(11):1019---1025, 1999) is capable of matching the performance of some of the best current representations for face identification and facial expression recognition. Previous work has shown that the Riesenhuber and Poggio Model features can achieve a high level of performance on object recognition tasks (Serre, T., et al. in IEEE Comput. Vis. Pattern Recognit. 2:994---1000, 2005). Here we modify the R P model in order to create a new set of features useful for face identification and expression recognition. Results from tests on the FERET, ORL and AR datasets show that these features are capable of matching and sometimes outperforming other top visual features such as local binary patterns (Ahonen, T., et al. in 8th European Conference on Computer Vision, pp. 469---481, 2004) and histogram of gradient features (Dalal, N., Triggs, B. in International Conference on Computer Vision Pattern Recognition, pp. 886---893, 2005). Having a model based on shared lower level features, and face and object recognition specific higher level features, is consistent with findings from electrophysiology and functional magnetic resonance imaging experiments. Thus, our model begins to address the complete recognition problem in a biologically plausible way.
Modeling health care facility location for moving population groups
Authors: Malick Ndiaye, Hesham Alfares
Venue: Computers and Operations Research (2008)

Locating public services for nomadic population groups is a difficult challenge as the locations of the targeted populations seasonally change. In this paper, the population groups are assumed to occupy different locations according to the time of the year, i.e., winter and summer. A binary integer programming model is formulated to determine the optimal number and locations of primary health units for satisfying a seasonally varying demand. This model is successfully applied to the actual locations of 17 seasonally varying nomadic groups in the Middle East. Computational tests are performed on different versions of the model in order analyze the tradeoffs among different performance measures.
On the complexity of the multivariate Sturm--Liouville eigenvalue problem
Authors: A. Papageorgiou
Venue: Journal of Complexity (2007)

We study the complexity of approximating the smallest eigenvalue of -@D+q with Dirichlet boundary conditions on the d-dimensional unit cube. Here @D is the Laplacian, and the function q is non-negative and has continuous first order partial derivatives. We consider deterministic and randomized classical algorithms, as well as quantum algorithms using quantum queries of two types: bit queries and power queries. We seek algorithms that solve the problem with accuracy @?. We exhibit lower and upper bounds for the problem complexity. The upper bounds follow from the cost of particular algorithms. The classical deterministic algorithm is optimal. Optimality is understood modulo constant factors that depend on d. The randomized algorithm uses an optimal number of function evaluations of q when d@?2. The classical algorithms have cost exponential in d since they need to solve an eigenvalue problem involving a matrix with size exponential in d. We show that the cost of quantum algorithms is not exponential in d, regardless of the type of queries they use. Power queries enjoy a clear advantage over bit queries and lead to an optimal complexity algorithm.
Global Software Development: Are Architectural Rules the Answer?
Authors: Viktor Clerc, Patricia Lago, Hans van Vliet
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Global software development (GSD) faces additional challenges as compared to single-site software development. Some of the better known challenges include temporal, geographical, and socio-cultural differences. To overcome these challenges, organizations need to revert to measures in order to deliver software in time in a distributed setting. Some of these measures may exist in the form of architectural rules: principles and statements on the software architecture that must be complied with throughout the organization. From the GSD literature we distilled four main GSD challenges and seven sub-challenges, or issues. For each issue, we list possible solutions and observe that solutions to GSD challenges may be obtained by adhering to architectural rules. We present a study on how two organizations involved in GSD solve the GSD challenges and issues. One of the organizations mainly uses rules regulating the architecture of the product. The other organization does not emphasize these architectural rules but rather focuses on the joint team effort in establishing and committing to measures that mainly pertain to the architecture process. We conclude that rules regulating a combination of both proves valuable in handling GSD challenges.
The Domain-Specific Language Monaco and its Visual Interactive Programming Environment
Authors: Herbert Prahofer, Dominik Hurnaus, Christian Wirth, Hanspeter Mossenbock
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Monaco is a domain-specific language for machine automation programming. It has been developed with the objective to empower domain experts with limited programming capabilities. Its main language features are an imperative notation for reactive systems, concepts for describing asynchronous event handling in a concise way, and a state-of-the-art component approach. Monaco is a programming language with a Pascal-like syntax, but also comes with a visual programming environment. In this paper we review the language Monaco, show the visual representation scheme, report on the programming environment and compare our visual notation to Statecharts.
Web-based education in mathematics and sciences
Authors: Slavka Tzanova
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this paper Web-based courses in mathematics, physics and chemistry developed within an European project are presented. The project is in the framework of the programme SOCRATES 2005-2007 of the European Community. The collaboration involves seven universities from four countries - France, Spain, Belgium and Bulgaria in an active joint work. Within the project some studies on the potential changes in education following the ICT revolution are being conducted. The main research aspects are related to: pedagogic effectiveness of the ICT-based learning of mathematics and sciences with activity-based approach and simulations; the change in educational mission from instruction to provision of methods for personal learning; the transition from objective to constructed knowledge.
A Genetic Particle Filter for Moving Object Tracking
Authors: Ming-Che Ho, Cheng-Chin Chiang, Yu-Long Chen
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Among the many techniques for tracking moving objects, the particle filter strongly attracts the researchers and developers for its simplicity and effectiveness. Two major problems suffered from the particle filter are the slow tracking speed caused by the examination of a large number of randomly generated particle samples and the position drifting of the tracked object caused by the interference from outlier particle samples. This paper proposes an improved solution to the above problems. Several experiments are conducted to verify the improvements over the conventional particle filter method.
Integrated Edge and Corner Detection
Authors: Sonya Coleman, Bryan Scotney, Dermot Kerr
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Corner detection is used in many computer vision applications that require fast and efficient feature matching. For tasks such as robot localisation and navigation, the use of corners for matching is preferred over edges or other, larger, features. In recent years finite-element based methods have been used to develop gradient operators for edge detection that have improved angular accuracy over standard techniques. We extend this work to corner detection, enabling edge and corner detection to be integrated. We demonstrate that accuracy is comparable to well-known existing corner detectors, and that significantly reduced computation time can be achieved, making the approach appropriate for real-time computer vision and robotics.
Learning temporal structure for task based control
Authors: Kingsley Sage, A. Jonathan Howell, Hilary Buxton, Antonis Argyros
Venue: Image and Vision Computing (2008)

We present an extension for variable length Markov models (VLMMs) to allow for modelling of continuous input data and show that the generative properties of these VLMMs are a powerful tool for dealing with real world tracking issues. We explore methods for addressing the temporal correspondence problem in the context of a practical hand tracker, which is essential to support expectation in task-based control using these behavioural models. The hand tracker forms a part of a larger multi-component distributed system, providing 3-D hand position data to a gesture recogniser client. We show how the performance of such a hand tracker can be improved by using feedback from the gesture recogniser client. In particular, feedback based on the generative extrapolation of the recogniser's internal models is shown to help the tracker deal with mid-term occlusion. We also show that VLMMs can be used as a means to inform the prior in an expectation maximisation (EM) process used for joint spatial and temporal learning of image features.
Axiomatising a linear higher order π-calculus
Authors: Zining Cao
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

In this paper, we present an inference system for weak context congruence over a linear higher order π-calculus. To prove the soundness and completeness of the inference system, we propose a new congruence, called linear normal congruence, and furthermore show the equivalence between context congruence and linear normal congruence for such a linear higher order π-calculus.
A Computer-Aided Robotic Arm/Worktable System for the High-Level Quadriplegic
Authors: W. Schneider
Venue: Computer (1981)

Opening the door to self-reliance for quadriplegics, this system provides manipulative capability for doing several tasks without assistance including typing and using a computer.
Scheduling Observations of Agile Satellites with Combined Genetic Algorithm
Authors: Yuqing Li, Minqiang Xu, Rixin Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper describes a combined genetic algorithm for selecting and scheduling tasks of agile earth observing satellites (AEOS). This kind of satellites has three degrees of freedom for acquiring images, and giving opportunities for a more efficient use of the satellite imaging capabilities. But the selection and scheduling of observations becomes significantly difficult, due to the larger search space for potential solutions. Hence, selecting and scheduling observations of agile satellites is a highly combinatorial problem. Inspired by successful commercial applications of evolutionary algorithms in scheduling domains, this paper presents work in progress regarding the use of combined genetic algorithm to solve it. Both the model problems and the algorithm are described. The validity of this approach is validated by emulations.
Bernstein--Bézier representation and near-minimally normed discrete quasi-interpolation operators
Authors: Domingo Barrera-Rosillo, María José Ibáòez-Pérez
Venue: Applied Numerical Mathematics (2008)

We are concerned with the construction of bivariate box-spline discrete quasi-interpolants with small infinity norms and optimal approximation orders. They are defined by minimizing a sharp upper bound of the uniform norm which is derived from the Bernstein-Bezier representation of the corresponding fundamental function. We detail the construction of such quadratic and quartic quasi-interpolants.
Image Handling In Two-Dimensional Design
Authors: E. A. Edmonds
Venue: IEEE Computer Graphics and Applications (1982)

A research team in England has developed an image manipulation system that enables graphics designers to work creatively with visual ambiguities.
Finding errors in components that exchange xml data
Authors: Mark Grechanik
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Two or more components (e.g., objects, modules, or programs) interoperate when they exchange data, such as XML data. Using Application Programming Interface (API) calls exported by XML parsers remains a primary mode of accessing and manipulating XML, and these API calls lead to various run-time errors in components that exchange XML data. Currently, no tool checks the source code of interoperating components for potential flaws caused by third-party API calls that lead to incorrect XML data exchanges and runtime errors, even when components are located within the same application Our solution combines program abstraction and symbolic execution in order to reengineer the approximate schema of XML data that would be output by a component. This schema is compared using bisimulation with the schema of XML data that is expected by some other components. We describe our approach and give our error checking algorithm. We implemented our approach in a tool that we used on open source and commercial systems and discovered errors that were not detected during their design and testing.
The Intel 8086 Microprocessor: a 16-bit Evolution of the 8080
Authors: S. P. Morse
Venue: Computer (1978)

The architecture and instruction set of this new 16-bit microprocessor were designed to meet the requirements of a broad spectrum of new microprocessor applications.
Mitigating the risk of high power damage to the BT network
Authors: E. Sikora, J. Wright, D. Mccartney, K. Farrow, R. Davey
Venue: BT Technology Journal (2007)

Optical powers used in optical telecommunications networks have increased over time with the advent of technologies such as erbium-doped fibre amplifiers, dense WDM, and fibre Raman amplifiers. Erbium fibre and Raman amplifiers with output powers up to 1 W and 2 W respectively are now available for deployment giving optical power densities of ¿ 14 000 MW/m2 per Watt launched into a single mode fibre. This compares with 74 MW/m2 for the surface of the sun. It is thus essential to ensure that the risk of optical damage to the fibre is understood and steps are taken to mitigate it where necessary.Research carried out by BT over the last few years has shown that fibres carrying relatively modest optical powers, as low as 200 mW for the most sensitive fibres, can be catastrophically damaged at tight fibre bends.Damage is caused by some of the optical power lost at the bend being absorbed by the fibre coating that may over time lead to a sudden increase in temperature to over 700 °C causing either the silica to kink mimicking a fibre break, or the coating to burn off at the bend leading to fibre failure on subsequent handling.This paper describes factors that increase the risk of short-term catastrophic damage at fibre bends, presents experimental results to show the variation in sensitivity between different fibres, and discusses new important theoretical results modelling the temperature rise in the fibre.
Note: The number of vertices whose out-arcs are pancyclic in a 2-strong tournament
Authors: Ruijuan Li, Shengjia Li, Jinfeng Feng
Venue: Discrete Applied Mathematics (2008)

An arc going out from a vertex x in a digraph is called an out-arc of x. Yao et al. [Discrete Appl. Math. 99 (2000) 245-249] proved that every strong tournament contains a vertex x such that all out-arcs of x are pancyclic. Recently, Yeo [J. Graph Theory 50 (2005) 212-219] proved that each 3-strong tournament contains two such vertices. In this paper, we confirm that Yeo's result is also true for 2-strong tournaments. Our proof implies a polynomial algorithm to find two such vertices.