ppxscal/embedding_network huggingface dataset:
Characterizations of linear suboptimality for mathematical programs with equilibrium constraints
Authors: B. S. Mordukhovich
Venue: Mathematical Programming: Series A and B (2009)

The paper is devoted to the study of a new notion of linear suboptimality in constrained mathematical programming. This concept is different from conventional notions of solutions to optimization-related problems, while seems to be natural and significant from the viewpoint of modern variational analysis and applications. In contrast to standard notions, it admits complete characterizations via appropriate constructions of generalized differentiation in nonconvex settings. In this paper we mainly focus on various classes of mathematical programs with equilibrium constraints (MPECs), whose principal role has been well recognized in optimization theory and its applications. Based on robust generalized differential calculus, we derive new results giving pointwise necessary and sufficient conditions for linear suboptimality in general MPECs and its important specifications involving variational and quasivariational inequalities, implicit complementarity problems, etc.
EDFCES: a new example-driven 3D face construction and editing system
Authors: Yu Zhang, Eric Sung
Venue: Machine Graphics Vision International Journal (2008)

This paper presents an automatic runtime system for generating varied, realistic face models by synthesizing a global face shape and local facial features according to intuitive, high-level control parameters. Our method takes as examples 3D face scans in order to exploit the parameter-to-geometry correlations present in real faces. In order to establish the correspondences among the scanned models, we use a three-step model fitting approach to conform a generic head mesh onto each scanned model. We transform the obtained data sets of global face shapes and local feature shapes into vector space representations by applying a principal component analysis (PCA). We compute a set of face anthropometric measurements to parameterize the exemplary shapes in the measurement spaces. Using PCA coefficients as a compact shape representation, we approach the shape synthesis problem by forming scattered data interpolation functions designed to generate the desired face shape by taking anthropometric parameters as input. At runtime, the interpolation functions are evaluated for the input parameter values to produce new face geometries at an interactive rate. The correspondence among all exemplary face textures is obtained by parameterizing the 3D generic mesh over a 2D image domain. The new feature texture with the desired attributes is synthesized by interpolating the example textures. The resulting system is intuitive to control and fine-grained. We demonstrate our method by applying different parameters to generate a wide range of face models.
An Agent-Based Intelligent Transport System
Authors: Xiaonan Liu, Zhiyi Fang
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

The rapid development of modern transportation brings tremendous challenges to the intelligent transport system. Intelligent computer supported cooperative work (CSCW) and wireless communication technology are more and more used in intelligent transport systems. In this paper, we adopt wireless communication technology: ad hoc network, GPS, GIS, WIMAX, and WiFi, and design an intelligent transport system based on a multi-agent system, and implement the design in our experimental environment. The proposed system will help vehicle drivers make quick responses to the road emergency. Meanwhile it will also help vehicle drivers around the emergency area to make appropriate decisions.
Assertion-based dynamic verification for executable UML specifications
Authors: Masahito Sugai, Akira Teruya, Eiichiro Iwata, Nurul Azma Zakaria, Noriko Matsumoto, Norihiko Yoshida
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Embedded systems have grown large and complex, and the man-hour requirement of their verification is increasing. In embedded systems design, Executable UML (xUML) is attracting attentions. It is a crucial issue to improve the efficiency of verification in xUML. We propose an assertion-based dynamic verification for xUML in this paper. The assertion-based verification improves verification efficiency and reliability of the systems. We implement a tool realize the assertion-based dynamic verification for xUML, and confirm the validity of our proposal through some experiments.
An Alternative Image Retrieval System Based on Visual and Thematic Corpus Organization
Authors: Gerald Duffing
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Retrieving images in large databases involves either thematic or visual querying capabilities. We think that both approaches can be efficiently combined to provide a thematically and visually relevant retrieval. This paper deals with bi-modal access in image retrieval systems. Our approach relies on a corpus organisation based on both visual and thematic clustering, allowing access to non-indexed images. An adapted retrieval process has been designed to reformulate queries, taking into account users' judgements that deal with thematic and visual aspects of their information needs.
Interpolation Processes: Basic Theory and Applications, 1 edition
Authors: Giuseppe Mastroianni, Gradimir V. Milovanovic
Venue: Springer Monographs In Mathematics (2008)

The classical books on interpolation address numerous negative results, i.e., results on divergent interpolation processes, usually constructed over some equidistant systems of nodes. The authors present, with complete proofs, recent results on convergent interpolation processes, for trigonometric and algebraic polynomials of one real variable, not yet published in other textbooks and monographs on approximation theory and numerical mathematics. In this special, but fundamental and important field of real analysis the authors present the state of art. Some 500 references are cited, including many new results of the authors. Basic tools in this field (orthogonal polynomials, moduli of smoothness, K-functionals, etc.) as well as some selected applications in numerical integration, integral equations, moment-preserving approximation and summation of slowly convergent series are also given. Beside the basic properties of the classical orthogonal polynomials the book provides new results on nonclassical orthogonal polynomials including methods for their numerical construction.
An Algebraic Approach to Guarantee Harmonic Balance Method Using Gröbner Base
Authors: Masakazu Yagi, Takashi Hisakado, Kohshi Okumura
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Harmonic balance (HB) method is well known principle for analyzing periodic oscillations on nonlinear networks and systems. Because the HB method has a truncation error, approximated solutions have been guaranteed by error bounds. However, its numerical computation is very time-consuming compared with solving the HB equation. This paper proposes an algebraic representation of the error bound using Gröbner base. The algebraic representation enables to decrease the computational cost of the error bound considerably. Moreover, using singular points of the algebraic representation, we can obtain accurate break points of the error bound by collisions.
On real factors of real interval polynomials
Authors: Hiroshi Sekigawa
Venue: Journal of Symbolic Computation (2009)

For a real multivariate interval polynomial P and a real multivariate polynomial f, we provide a rigorous method for deciding whether there is a polynomial p in P such that f is a factor of p. When P is univariate, there is a well-known criterion for whether there exists a polynomial p in P such that p(a)=0 for a given real number a. Since p(a)=0 if and only if x-a is a factor of p, our result is a generalization of the criterion to multivariate polynomials and higher degree factors. Furthermore, for real multivariate polynomials p and f, we show a method for computing a nearest polynomial q to p in a weighted l^~-norm such that f is a factor of q.
Object-extended OLAP querying
Authors: Torben Bach Pedersen, Junmin Gu, Arie Shoshani, Christian S. Jensen
Venue: Data Knowledge Engineering (2009)

On-line analytical processing (OLAP) systems based on a dimensional view of data have found widespread use in business applications and are being used increasingly in non-standard applications. These systems provide good performance and ease-of-use. However, the complex structures and relationships inherent in data in non-standard applications are not accommodated well by OLAP systems. In contrast, object database systems are built to handle such complexity, but do not support OLAP-type querying well. This paper presents the concepts and techniques underlying a flexible, ''multi-model'' federated system that enables OLAP users to exploit simultaneously the features of OLAP and object systems. The system allows data to be handled using the most appropriate data model and technology: OLAP systems for dimensional data and object database systems for more complex, general data. This allows data analysis on the OLAP data to be significantly enriched by the use of additional object data. Additionally, physical integration of the OLAP and the object data can be avoided. As a vehicle for demonstrating the capabilities of the system, a prototypical OLAP language is defined and extended to naturally support queries that involve data in object databases. The language permits selection criteria that reference object data, queries that return combinations of OLAP and object data, and queries that group dimensional data according to object data. The system is designed to be aggregation-safe, in the sense that it exploits the aggregation semantics of the data to prevent incorrect or meaningless query results. These capabilities may also be integrated into existing languages. It is shown how to integrate relational and XML data using the technology. A prototype implementation of the system is reported, along with performance measurements that show that the approach is a viable alternative to a physically integrated data warehouse.
Model-Based Techniques for Data Reliability in Wireless Sensor Networks
Authors: Shoubhik Mukhopadhyay, Curt Schurgers, Debashis Panigrahi, Sujit Dey
Venue: IEEE Transactions on Mobile Computing (2009)

Wireless Sensor Networks are a fast-growing class of systems. They offer many new design challenges, due to stringent requirements like tight energy budgets, low-cost components, limited processing resources, and small footprint devices. Such strict design goals call for technologies like nanometer-scale semiconductor design and low-power wireless communication to be used. But using them would also make the sensor data more vulnerable to errors, within both the sensor nodes' hardware and the wireless communication links. Assuring the reliability of the data is going to be one of the major design challenges of future sensor networks. Traditional methods for reliability cannot always be used, because they introduce overheads at different levels, from hardware complexity to amount of data transmitted. This paper presents a new method that makes use of the properties of sensor data to enable reliable data collection. The approach consists of creating predictive models based on the temporal correlation in the data and using them for real-time error correction. This method handles multiple sources of errors together without imposing additional complexity or resource overhead at the sensor nodes. We demonstrate the ability to correct transient errors arising in sensor node hardware and wireless communication channels through simulation results on real sensor data.
Structuring and manipulating hand-drawn concept maps
Authors: Yingying Jiang, Feng Tian, Xugang Wang, Xiaolong Zhang, Guozhong Dai, Hongan Wang
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Concept maps are an important tool to knowledge organization, representation, and sharing. Most current concept map tools do not provide full support for hand-drawn concept map creation and manipulation, largely due to the lack of methods to recognize hand-drawn concept maps. This paper proposes a structure recognition method. Our algorithm can extract node blocks and link blocks of a hand-drawn concept map by combining dynamic programming and graph partitioning and then build a concept-map structure by relating extracted nodes and links. We also introduce structure-based intelligent manipulation technique of hand-drawn concept maps. Evaluation shows that our method has high structure recognition accuracy in real time, and the intelligent manipulation technique is efficient and effective.
Restructuring the IS Curriculum around the Theme of Service Orientation
Authors: Bill Karakostas
Venue: IT Professional (2009)

This article proposes restructuring and updating the information systems (IS) course curriculum to reflect current and forthcoming changes in the IS profession caused primarily by the growing popularity of service orientation both in the business and information technology domains.
End-user programming of mashups with vegemite
Authors: James Lin, Jeffrey Wong, Jeffrey Nichols, Allen Cypher, Tessa A. Lau
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Mashups are an increasingly popular way to integrate data from multiple web sites to fit a particular need, but it often requires substantial technical expertise to create them. To lower the barrier for creating mashups, we have extended the CoScripter web automation tool with a spreadsheet-like environment called Vegemite. Our system uses direct-manipulation and programming-by-demonstration tech-niques to automatically populate tables with information collected from various web sites. A particular strength of our approach is its ability to augment a data set with new values computed by a web site, such as determining the driving distance from a particular location to each of the addresses in a data set. An informal user study suggests that Vegemite may enable a wider class of users to address their information needs.
New method for determination of potato slice shrinkage during drying
Authors: Alireza Yadollahinia, Acefeh Latifi, Reza Mahdavi
Venue: Computers and Electronics in Agriculture (2009)

Shrinkage during drying plays an important role in determining the quality of the dried product. In this paper, a method based on computer vision was used to analyze the effect of drying on shrinkage of potato slices. The computer vision system consisted of a digital camera, illumination, computer hardware and software was developed to capture and process the images. Variations in area, perimeter, major and minor diameters, diameters parallel and perpendicular to airflow, Feret diameter, roundness were measured in intervals during drying. All morphological features decreased smoothly with drying time. Shrinkage of the potato slices decreased almost linearly with moisture content. Results showed that airflow direction had significant effect on parallel and perpendicular diameters in 60 and 70^oC and had no significant effect when temperature was 80^oC. Drying time decreased with increasing air temperature.
A Low-Cost Fault-Tolerant Approach for Hardware Implementation of Artificial Neural Networks
Authors: A. Ahmadi, M. H. Sargolzaie, S. M. Fakhraie, C. Lucas, S. Vakili
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Artificial Neural Networks (ANNs) are widely used in computational and industrial applications. As technology is developed the scale of hardware is progressively becoming smaller and the number of faults is increasing. Therefore, fault-tolerant methods are necessary especially for ANNs used in critical applications. In this work, we propose a new method for fault-tolerant implementation of neural networks. In hidden and output layers, we add a spare neuron, and one of hidden and output neurons is tested by each input pattern. Our technique detects and corrects any single fault in the network. We achieve complete fault tolerance for single faults with at most 40% area overhead.
The effect of mismatch in current- versus voltage-mode resistive grids
Authors: Bertram E. Shi
Venue: International Journal of Circuit Theory and Applications (2009)

Resistive grids are commonly used in neuromorphic very large-scale integration (VLSI) designs for image smoothing and signal aggregation. Because mismatch is inevitable in VLSI chips, one reason that resistive grids are attractive is that their output is robust to mismatch in the component values. Here, we examine relative sensitivity of different resistive grid designs that differ depending upon whether the input and output are represented by current or voltage. Our analysis reveals that a mixed-mode design, where the input is represented by current but the output is represented by voltage, is less sensitive to mismatch when the amount of smoothing is large. On the other hand, when little smoothing is desired, pure voltage-mode and current-mode designs are preferred. From the point of view of mismatch sensitivity, there is little difference between the two pure-mode designs. Our analysis also reveals that the difference in mismatch sensitivity is due to the vertical resistors, which are the most sensitive to mismatch in all the three designs studied. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Model Checking: Progress and Problems
Authors: E. Allen Emerson
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

Model checking is an automatic method of verifying finite state concurrent programs. The use of temporal logic and related frameworks to specify correctness has greatly facilitated simply thinking about the verification problem. Despite early worries about the intractability of state explosion, nowadays it can often be ameliorated, permitting verification of enormously large systems in practice. Important techniques include abstraction and compact (symbolic) representation.Unfortunately, none of these techniques scale well beyond a certain range. Nor is temporal logic universally viewed as a natural specification framework. We will discuss some possible ways to enhance efficiency and expressiveness of model checking.
An Implementation of Extended P-Log Using XASP
Authors: Han The Anh, Carroline D. Kencana Ramli, Carlos Viegas Damásio
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

We propose a new approach for implementing P-log using XASP, the interface of XSB with Smodels. By using the tabling mechanism of XSB, our system is most of the times faster than P-log. In addition, our implementation has query features not supported by P-log, as well as new set operations for domain definition.
The implementation of the PROPHET system
Authors: P. A. Castleman, C. H. Russell, F. N. Webb, C. A. Hollister, J. R. Siegel, S. R. Zdoxik, D. M. Fram
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

PROPHET is a computer system designed to augment the information-handling capabilities of individual scientists. It is oriented toward the needs of pharmacologists, medicinal chemists, and other scientists who study how chemical substances affect biological activity. The system hardware consists of a large time-sharing computer connected over telephone lines to display terminals (Figure 1) in medical schools, hospitals, and other pharmacological research centers. PROPHET's software provides a computing environment, tailored to deal with chemical and biological information, which allows non-programming users to perform complex operations and also supports programming users who wish to extend the system in new ways. PROPHET's purpose is to aid individual research rather than to distribute existing data bases; it does, however, possess capabilities and data structures to facilitate the sharing of data and algorithms between users.
Proposal and evaluation of multiple gateways distribution method for wireless mesh network
Authors: Masashi Ito, Toshihiro Shikama, Akira Watanabe
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Researches on the wireless mesh network in which access points (APs) of a wireless LAN are connected by an ad-hoc networks are recently drawing much attention. In the wireless mesh network, APs can be set up freely and its areas can be expanded easily. For the wireless mesh network, methods of utilizing multiple gateways (GWs) at the time of making a connection with an exterior network such as the Internet have been studied in order to resolve the congestion problem around GWs, which is the bottleneck in gaining a high throughput. Although a method of distributing packets to different GWs has been studied hitherto, the method tend to lower the communication throughput due to the function of TCP's congestion control. Thus, we propose a method of utilizing GWs effeciently by distributing packets to multiple GW "in units of session" (i.e. one of GWs is selected session by session). This method does not give any influence on the throughput of TCP communication. By conducting a simulation, we confirmed that our proposed method performed a higher TCP communication throughput than the existing method while the fairness is sufficiently maintained.
Creativity support: insights from the practices of digital-atomic artists
Authors: R. T. Jim Eales, Dharani Perera
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

The support of human creativity by information and communication technology is an important and interesting area for research. To advance our research in this complex area our approach has been to go back to first principles and study examples of creativity in action. In this paper, we describe in some detail the creative practices of two artists. Their work is particularly interesting to us because of the way it straddles the digital-atomic border. Their creative practices involve not only manipulating paint atoms but also manipulating digital bits. From these studies we identify a number of interesting creativity support areas that suggest further investigation.
Multiscale 3D reference visualization
Authors: Michael Glueck, Keenan Crane, Sean Anderson, Andres Rutnik, Azam Khan
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Reference grids are commonly used in design software to help users judge distances and understand the orientation of the virtual workspace. Despite their ubiquity in 3D graphics applications, little research has gone into important design considerations of the 3D reference grids themselves, which directly impact their usefulness. We have developed two new techniques; the multiscale reference grid and position pegs that form a consistent foundation for presenting relative scale and position information to the user. Our design of a multiscale reference grid consistently subdivides and coalesces gridlines, based on the computation of a closeness metric, while ensuring that there are neither too many nor too few subdivisions. Position pegs extend the grid so that objects that are lying above or below the ground plane can be brought into a common environmental frame of reference without interfering with the grid or object data. We provide a stable analytic viewpoint-determined result, solving several depth cue problems, that is independent of viewing projection.