ppxscal/embedding_network huggingface dataset:
Facial Expressive Image Analysis by Using Nonlinear Factorization Model
Authors: Chuan Zhou, Yangzhou Du, Xueyin Lin
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Facial images captured by camera are usually influenced by several different kinds of factor, such as human identity, facial expression, and etc. Therefore facial expressive image analysis plays an important role in many different applications, such as expression recognition, face recognition with expressive images, facial expressive image synthesis and etc. In this paper, "human identity" and "facial expression" are regarded as two influence factors of face appearance, and a novel kernel-based bilinear factorization method is proposed to decouple the interaction from each other. The trained non-linear factorization model has been used for facial expressive image translation, and to person and/or expression recognition, and got promising results. In this paper the principle of our method is described and some preliminary experimental results are included.
Boundary Control of the Linearized Ginzburg--Landau Model of Vortex Shedding
Authors: Ole Morten Aamo, Andrey Smyshlyaev, Miroslav Krstic
Venue: SIAM Journal on Control and Optimization (2005)

In this paper, we continue the development of state feedback boundary control laws based on the backstepping methodology, for the stabilization of unstable, parabolic partial differential equations. We consider the linearized Ginzburg--Landau equation, which models, for instance, vortex shedding in bluff body flows. Asymptotic stabilization is achieved by means of boundary control via state feedback in the form of an integral operator. The kernel of the operator is shown to be twice continuously differentiable, and a series approximation for its solution is given. Under certain conditions on the parameters of the Ginzburg--Landau equation, compatible with vortex shedding modelling on a semi-infinite domain, the kernel is shown to have compact support, resulting in partial state feedback. Simulations are provided in order to demonstrate the performance of the controller. In summary, the paper extends previous work in two ways: (1) it deals with two coupled partial differential equations, and (2) under certain circumstances handles equations defined on a semi-infinite domain.
Improvement of performance to discriminate malignant tumors from normal tissue on mammograms by feature selection and evaluation of feature selection criteria
Authors: Sachiko Furuya, Jun Wei, Yoshihiro Hagihara, Akinobu Shimizu, Hidefumi Kobatake, Shigeru Nawano
Venue: Systems and Computers in Japan (2004)

This paper reports the results of improving the performance of a previous system for discriminating malignant tumors by selecting a small number of features effective for discriminating malignant tumors from normal tissue on mammograms from 39 features. Specifically, the efficacy of the new system is evaluated by comparing the results with the case of using the previous 9 features. The paper also reports on the results of comparing the areas Az under ROC curves using Mahalanobis distance ratios, the areas Az under ROC curves based on the maximum likelihood method, and the average recognition rates based on the nearest-neighbor decision rule. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 72&ndash;84, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10587
Book Review: Approaches to Knowledge Representation - An Introduction. Edited by G. A. Ringland & D. A. Duce (Research Studies Press Ltd., John Wiley & Sons Inc.(
Venue: Issue 110 (October 1989) (1989)

This collection is entirely edited and authored by members of the Knowledge Based Systems Group, Informatics Division of the Rutherford Appleton Laboratory, Didcot, UK, a research Institute funded by the Science amp; and Engineering Research Council. As such it is an entirely British collection which provides an introductory text with a slightly different viewpoint as nearly all contributions to the field have been of North American origin (at least this is the impression one gets from other texts).
Calculational derivation of a counter with bounded response time and bounded power dissipation
Authors: Joep L. W. Kessels
Venue: Distributed Computing (1995)

A counter is calculationally designed by applying a functional way of programming, in which a machine is conceived as a function from states to behaviours. The design exploits the fine-grained concurrency available in VLSI. It is obtained by applying a series of correctness-preserving transformations on an initial design, which satisfies the functional specification but does not meet the cost/performance requirements. The transformations are purely calculational, i.e. they are based on a few simple axioms. The design is generic in that it describes counters with all possible periods. An attractive property of the design is that all these counters have the same response time as well as the same power dissipation.
Comparisons between Heuristics Based on Correlativity and Efficiency for Landmarker Generation
Authors: Daren Ler, Irena Koprinska, Sanjay Chawla
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Recently, we proposed a new meta-learning approach based on landmarking. This approach, which utilises a new set of criteria for selecting landmarkers, generates a set of landmarkers that are each functions over the performance over subsets of the candidate algorithms being landmarked. In this paper, we experiment with three heuristics based on correlativity and efficiency. With each heuristic, the landmarkers generated using linear regression are able to estimate accuracy well, even when only utilising a small fraction of the given algorithms. The resultsalso show that the heuristic in which efficiencies are estimated via 1-nearest neighbour outperformed the other heuristics.
Exporting Storage Systems in a Scalable Manner with pNFS
Authors: Dean Hildebrand, Peter Honeyman
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

To meet enterprise and grand challenge-scale performance and interoperability requirements, a group of engineers-initially ad-hoc but now integrated into the IETF-is designing extensions to NFSv4 that provide parallel access to storage systems. This paper gives an overview of pNFS, an emerging NFSv4 extension that promises file access scalability plus operating system and storage system independence. pNFS bypasses the server bottleneck by enabling direct access to storage by NFSv4 clients and by providing a framework for the co-existence of NFSv4 with other file access protocols. In this paper, we describe an implementation that demonstrates and validates pNFS' potential. The I/O throughput of our prototype matches that of its exported file system and far exceeds standard NFSv4.
Demo: eureauweb&trade;: an information system for users of European inland waterways
Authors: Holger Kirchner, Bendick Mahleko, Lorna Elkington, Tony Elkington
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Currently different sources of information exist for users of waterways like audio guides, catalogs, web sites dedicated to waterway users, CDs, flyers, kiosk-based systems etc. These information sources lack in a number of aspects: (i) it is not possible to provide the user with relevant and up-to-date information based on the current location of the user (ii) they provide no ability to proactively provide relevant information (iii) they provide no transparent support for different end-user devices like PDAs, Laptops, handheld PCs.eureauweb is a service-based system addressing the above limitations by providing support for users of European waterways during all three phases of a trip.
Book Review: Qualitative Process Theory Using Linguistic Variables by Bruce D'Ambrosio (Springer-Verlag New York 1989)
Venue: ACM SIGART Bulletin (1991)

Probably, most of the readers of this Bulletin are quite familiar with Forbus's [2] Qualitative process theory which I'll refer to from now on as QPT. QPT is a popular, satisfactorily sound, and rather complete (do not read the last two words in the logical sense) theory for reasoning about the physical aspects of the daily world, viz, the enterprise of qualitative reasoning. (See [5] for an excellent recent review of qualitative reasoning.) The book under review is an attempt to fill in some gaps in QPT and render it more complete. And in this, it succeeds admirably.
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints
Authors: Ph. Mauguière, J.-C. Billaut, J.-L. Bouquard
Venue: Journal of Scheduling (2005)

In this paper we deal with variants of traditional cases of unavailability constraints in scheduling problems. In the literature, two main approaches are usually found. In the first one, operations can be interrupted by unavailability periods and in the second one, operations cannot be interrupted. The context we consider is more general; some operations can be interrupted, the others cannot. Moreover, we assume that information can be related to operations as well as to unavailability periods. Consequently an unavailability period can make possible or not the interruption of an operation. As an application to this new problem, the single machine problem with heads and tails and the job-shop scheduling problem are tackled. All combinations of possible cases are studied and after a review of the state-of-the-art, branch-and-bound algorithms are proposed to solve these problems. Finally, computational experiments are conducted and discussed.
The Digital Society and Its Enemies: A Critique of 'On the Internet'
Authors: John Weckert
Venue: ACM SIGCAS Computers and Society (2004)

In his recent publication On the Internet Professor Hubert Dreyfus makes some interesting criticisms on the effectiveness of Internet-based distance learning and on the use of the Internet in general. There is still relatively little written on the philosophical and social implications of the Internet that is both clear and cohesive. Professor Dreyfus' book is exemplary in this regard, and it has attracted many followers extolling its virtues. However, there are serious issues with both the metho d and the content of his approach. His content is arguably restricted by a limited view of the Internet while his selective method of projecting the thoughts of long dead writers to a current phenomenon far from finished or even fully understood, may be considered a perilous undertaking for a system atic philosopher. For example, Professor Dreyfus offers the unusual suggestion that the Internet is the successor to the popular press of the mid-nineteenth century. It was the popular press that the Danish philosopher S&oslash;ren Kierkegaard derided for its instant opinions, anonymity, and lack of an ethical (or even reli gious) position. On the Internet applies Kierkegaard's criticisms to the Internet and further argues that hypermedia (and Internet information retrieval) is hype. Dreyfus believes that Internet-based learning cannot develop mastery or convey a sense of presence of other people or of reality in general. This paper will investigate whether we can definitely view the Internet as analogous to Kierkegaard's enemy, the popular press, and if there are current examples where the Internet augments our understanding and experiencing of the world without us actually being at the `virtual' scene.
Geo-spatial data mining in the analysis of a demographic database
Authors: M. Yasmina Santos, L. Alfredo Amaral
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

Spatial data mining refers to the extraction of knowledge, spatial relationships, or other interesting patterns not explicitly stored in spatial databases. The approaches usually followed in the analysis of geo-spatial data with the aim of knowledge discovery are essentially characterised by the development of new algorithms, which treat the position and extension of objects mainly through the manipulation of their co-ordinates. In this paper a new approach to this process is presented, where geographic identifiers give the positional aspects of geographic data. These identifiers are manipulated using qualitative reasoning principles, which allow for the inference of new spatial relations required for the data mining step of the knowledge discovery process. The analysis of a demographic database, with the proposed principles, enabled the discovery of patterns that are hidden in the explored geo-spatial and demographic data.
XQuery containment in presence of variable binding dependencies
Authors: Li Chen, Elke A. Rundensteiner
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Semantic caching is an important technology for improving the response time of future user queries specified over remote servers. This paper deals with the fundamental query containment problem in an XQuery-based semantic caching system. To our best knowledge, the impact of subtle differences in XQuery semantics caused by different ways of specifying variables on query containment has not yet been studied. We introduce the concept of variable binding dependencies for representing the hierarchical element dependencies preserved by an XQuery. We analyze the problem of XQuery containment in the presence of such dependencies. We propose a containment mapping technique for nested XQuery in presence of variable binding dependencies. The implication of the nested block structure on XQuery containment is also considered. We mention the performance gains achieved by a semantic caching system we build based on the proposed technique.
Exchanging intensional XML data
Authors: Tova Milo, Serge Abiteboul, Bernd Amann, Omar Benjelloun, Fred Dang Ngoc
Venue: ACM Transactions on Database Systems (TODS) (2005)

XML is becoming the universal format for data exchange between applications. Recently, the emergence of Web services as standard means of publishing and accessing data on the Web introduced a new class of XML documents, which we call intensional documents. These are XML documents where some of the data is given explicitly while other parts are defined only intensionally by means of embedded calls to Web services.When such documents are exchanged between applications, one has the choice of whether or not to materialize the intensional data (i.e., to invoke the embedded calls) before the document is sent. This choice may be influenced by various parameters, such as performance and security considerations. This article addresses the problem of guiding this materialization process.We argue that---like for regular XML data---schemas (&agrave; la DTD and XML Schema) can be used to control the exchange of intensional data and, in particular, to determine which data should be materialized before sending a document, and which should not. We formalize the problem and provide algorithms to solve it. We also present an implementation that complies with real-life standards for XML data, schemas, and Web services, and is used in the Active XML system. We illustrate the usefulness of this approach through a real-life application for peer-to-peer news exchange.
Non-dictionary-based Thai word segmentation using decision trees
Authors: Thanaruk Theeramunkong, Sasiporn Usanavasin
Venue: Proceedings of the first international conference on Human language technology research (2001)

For languages without word boundary delimiters, dictionaries are needed for segmenting running texts. This figure makes segmentation accuracy depend significantly on the quality of the dictionary used for analysis. If the dictionary is not sufficiently good, it will lead to a great number of unknown or unrecognized words. These unrecognized words certainly reduce segmentation accuracy. To solve such problem, we propose a method based on decision tree models. Without use of a dictionary, specific information, called syntactic attribute, is applied to identify the structure of Thai words. C4.5 is used as a tool for this purpose. Using a Thai corpus, experiment results show that our method outperforms some well-known dictionary-dependent techniques, maximum and longest matching methods, in case of no dictionary.
A modeling lab for discovery-learning in computer science
Authors: Alfred L. McKinney
Venue: Journal of Computing Sciences in Colleges (2005)

This paper describes our recent successful effort to obtain grant funding to enhance an existing computer lab with new hardware and software in order to provide a state-of-the-art computerized presentation/modeling/discovery-learning environment. The focus is on the project's rationale, objectives, implementation, impact on our curriculum and assessment. There is a discussion of a national workshop that was recently conducted in the lab and the potential for future workshops. Two modeling examples are presented, and conclusions are given about the project's accomplishments and its future impact.
A modular integer GCD algorithm
Authors: Kenneth Weber, Vilmar Trevisan, Luiz Felipe Martins
Venue: Journal of Algorithms (2005)

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111-116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111-122] when U and V are close to the same size, that replaces U by (U - bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (- p/2, p/2) such that b ≡ UV-1 (mod p). When the algorithm is executed on a bit common CRCW PRAM with O(n log n log log log n) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/log n) time on the same number of processors.
Grids of agents for computer and telecommunication network management: Research Articles
Authors: M. D. Assunção, F. L. Koch, C. B. Westphall
Venue: Concurrency and Computation: Practice Experience (2004)

The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the amount and diversity of managed equipment. Moreover, the increase in complexity of the services being offered through the networks also contributes to adding extra workload to the management station. The amount of data that must be handled and processed by only one administration point could lead to a situation where there is not enough processing and storage power to carry out an efficient job. In this work we present an alternative approach by creating a highly distributed computing environment through the use of Grids of autonomous agents to analyze large amounts of data, which reduce the processing costs by optimizing the load distribution and resource utilization. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Feature Selection and Classification of Gene Expression Profile in Hereditary Breast Cancer
Authors: Mansoor Raza, Iqbal Gondal, David Green, Ross L. Coppel
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Correct classification and prediction of tumor cells is essential for successful diagnosis and reliable future treatment. However, it is very challenging to distinguish between tumor classes using microarray with thousands of gene expressions. Removing irrelevant genes is very helpful for us to learn the relationship between genes and tumors. In this paper we have used two methods: Multivariate Permutation Test (MPT) and Significant Analysis of Microarray (SAM) to select significant genes for feature selection. Using those selected features, we applied Support Vector Machine, (SVM) with polynomial, radial and linear kernels, to predict the class of testing data. Our result shows that all the samples are classified correctly. We have achieved 100% accuracy in classification among all the samples with polynomial kernel of SVM while Liner kernel shows no misclassification among BRCA1-BRCA2 and BRCA1-sporadic.
The Karhunen-Loève Transform of Discrete MVL Functions
Authors: Mitchell Aaron Thornton
Venue: Proceedings of the 35th International Symposium on Multiple-Valued Logic (2005)

The Karhunen-Loève (KL) transform of a discrete multiple-valued logic function is studied with respect to algebraic graph theory. The spectrum of a Cayley graph defined over the symmetry group is observed to be equivalent to the KL spectrum of a discrete function when the Cayley graph is generated using that function. It is also observed that the autocorrelation of the discrete function using the symmetry group operator is equivalent to the adjacency matrix of the Cayley graph. In addition to the theoretical interests, the KL spectrum of a discrete multiple-valued logic function can have applications in compact function representation and the determination of function estimates with a reduced support set. Example computations are shown in addition to the presentation of the mathematical properties.
Investigating a Wrapper Approach for Selecting Features Using Constructive Neural Networks
Authors: Daniel Monegatto Santoro, Maria do Carmo Nicoletti
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper investigates the problem of feature subset selection using a wrapper approach implemented using genetic algorithm and a constructive neural network. The main goal of the experiments conducted is to investigate whether the subset of features identified by the wrapper approach, implemented using the DistAl constructive neural algorithm, can also improve the accuracy of other constructive neural algorithms, namely, Tower, Tiling and Upstart algorithms. The results show that, in spite of the wrapper being directed by DistAl, the feature subsets selected can improve the accuracy of the other constructive neural algorithms as well.
Optimization of Three Dimensional Retro-Directive Arrays
Authors: Bin Feng, Zhizhang (David) Chen
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Retrodirective antenna systems have presented a very attractive feature of transmitting their RF energy back in the directions of their received signals. Much of the research efforts have so far been focused on electronic parts of the systems rather than on antenna array configurations they used. In this paper, we present a numerical scheme that can optimize the retrodirective array performance by finding optimum positioning of the array elements. In it, the surfaces which the array elements are to be placed on are discretized into a numerical grid of meshes. An objective function is then constructed by taking into account of array directivity (D), side lobe level (SLL) and half power beam width (HPBW). The optimum positioning of array elements are then found by searching for minimum objective function values when elements are placed over different grid points. The simulation results are presented to demonstrate the effectiveness of the method.