ppxscal/embedding_network huggingface dataset:
Bayesian segmentation and motion estimation in video sequences using a Markov-Potts model
Authors: Patrice Brault, Ali Mohammad-Djafari
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

The segmentation of an image can be presented as an inverse ill-posed problem. The segmentation problem is presented as, knowing an observed image g, how to obtain an original image f in which a classification in statistically homogeneous regions must be established. The inversion technique we use is done in a Bayesian probabilistic framework. Prior hypothesis, made on different parameters of the problem leads to the expression of posterior probability laws from which we can estimate the searched, realistic, segmentation. We report here a new approach for the segmentation of video sequences based on recent works on the Bayesian segmentation and fusion [3, 4, 5]. In our Bayesian framework we make the assumption that the images follow a Potts-Markov random field model. The final implementation is done with Markov Chain Monte Carlo (MCMC) and Gibbs sampling algorithms. The originality here resides in the fact that the sequence segmentation is done sequentially from one frame to the next in a Markov Space "temporal-like" framework. The result is also used for a first approach of motion estimation.
Agent-Based Shop-Floor Control System in a Dynamic Environment
Authors: Serafettin Alpay, Inci Sariçiçek
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Shop-floor control system plays important role to handle the problems come from the dynamic nature of the shop-floor. In this study, an Agent-Based Shop-Floor Control System is designed. Agents in the system are Marketing Agent, Production Planning Agent, Purchasing Agent and Shop-Floor Agents: Job, Machine and Cell. Designed distributed system contains heterogeneous units and was designed as hybrid control architecture. The study focuses on constructing an Agent-Based Shop-Floor Control System which has ability to manage dynamic scheduling activities. Shop-Floor Agents work in a harmony with each other in order to generate the schedules dynamically.
2008 Special Issue: Powered ankle-foot prosthesis to assist level-ground and stair-descent gaits
Authors: Samuel Au, Max Berniker, Hugh Herr
Venue: Neural Networks (2008)

The human ankle varies impedance and delivers net positive work during the stance period of walking. In contrast, commercially available ankle-foot prostheses are passive during stance, causing many clinical problems for transtibial amputees, including non-symmetric gait patterns, higher gait metabolism, and poorer shock absorption. In this investigation, we develop and evaluate a myoelectric-driven, finite state controller for a powered ankle-foot prosthesis that modulates both impedance and power output during stance. The system employs both sensory inputs measured local to the external prosthesis, and myoelectric inputs measured from residual limb muscles. Using local prosthetic sensing, we first develop two finite state controllers to produce biomimetic movement patterns for level-ground and stair-descent gaits. We then employ myoelectric signals as control commands to manage the transition between these finite state controllers. To transition from level-ground to stairs, the amputee flexes the gastrocnemius muscle, triggering the prosthetic ankle to plantar flex at terminal swing, and initiating the stair-descent state machine algorithm. To transition back to level-ground walking, the amputee flexes the tibialis anterior muscle, triggering the ankle to remain dorsiflexed at terminal swing, and initiating the level-ground state machine algorithm. As a preliminary evaluation of clinical efficacy, we test the device on a transtibial amputee with both the proposed controller and a conventional passive-elastic control. We find that the amputee can robustly transition between the finite state controllers through direct muscle activation, allowing rapid transitioning from level-ground to stair walking patterns. Additionally, we find that the proposed finite state controllers result in a more biomimetic ankle response, producing net propulsive work during level-ground walking and greater shock absorption during stair descent. The results of this study highlight the potential of prosthetic leg controllers that exploit neural signals to trigger terrain-appropriate, local prosthetic leg behaviors.
An integrated modelling framework for simulating regional-scale actor responses to global change in the water domain
Authors: R. Barthel, S. Janisch, N. Schwarz, A. Trifkovic, D. Nickel, C. Schulz, W. Mauser
Venue: Environmental Modelling Software (2008)

Within coupled hydrological simulation systems, taking socio-economic processes into account is still a challenging task. In particular, systems that aim at evaluating impacts of climatic change on large spatial and temporal scales cannot be based on the assumption that infrastructure, economy, demography and other human factors remain constant while physical boundary conditions change. Therefore, any meaningful simulation of possible future scenarios needs to enable socio-economic systems to react and to adapt to climatic changes. To achieve this it is necessary to simulate decision-making processes of the relevant actors in a way which is adequate for the scale, the catchment specific management problems to be investigated and finally the data availability. This contribution presents the DeepActor approach for representing such human decision processes, which makes use of a multi-actor simulation framework and has similarities to agent-based approaches. This DeepActor approach is embedded in Danubia, a coupled simulation system comprising 16 individual models to simulate Global Change impacts on the entire water cycle of the Upper Danube Catchment (Germany, 77,000km^2). The applicability of Danubia and in particular the DeepActor approach for treating the socio-economic part of the water cycle in a process-based way is demonstrated by means of concrete simulation models of the water supply sector and of the domestic water users. Results from scenario simulations are used to demonstrate the capabilities and limitations of the approach.
Design of a hybrid system for the diabetes and heart diseases
Authors: Humar Kahramanli, Novruz Allahverdi
Venue: Expert Systems with Applications: An International Journal (2008)

Data can be classified according to their properties. Classification is implemented by developing a model with existing records by using sample data. One of the aims of classification is to increase the reliability of the results obtained from the data. Fuzzy and crisp values are used together in medical data. Regarding to this, a new method is presented for classification of data of a medical database in this study. Also a hybrid neural network that includes artificial neural network (ANN) and fuzzy neural network (FNN) was developed. Two real-time problem data were investigated for determining the applicability of the proposed method. The data were obtained from the University of California at Irvine (UCI) machine learning repository. The datasets are Pima Indians diabetes and Cleveland heart disease. In order to evaluate the performance of the proposed method accuracy, sensitivity and specificity performance measures that are used commonly in medical classification studies were used. The classification accuracies of these datasets were obtained by k-fold cross-validation. The proposed method achieved accuracy values 84.24% and 86.8% for Pima Indians diabetes dataset and Cleveland heart disease dataset, respectively. It has been observed that these results are one of the best results compared with results obtained from related previous studies and reported in the UCI web sites.
Evaluating usability: using models of argumentation to improve persuasiveness of usability feedback
Authors: Mie Nørgaard, Rune T. Høegh
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Usability evaluation is widely accepted as a valuable activity in software development. However, how results effectively are fed back to developers is still a relatively unexplored area. We argue that usability feedback can be understood as an argument for a series of usability problems, and that basic concepts from argumentation theory can help us understand how to create persuasive feedback. We revisit two field studies on usability feedback to study if concepts from Toulmin's model for argumentation and Aristotle's modes of persuasion can explain why some feedback formats outperform others. We recommend that evaluators specifically back up the warrants behind their usability claims, that their arguments use several modes of persuasion, and that they present feedback in browsable amounts not to overwhelm developers with information. For complex and controversial problems, we advise evaluators to involve developers in a learning process and provide the opportunity to experience and discuss the findings.
A proof of Σaj1···ajn-i≥ Σλj1···λjn-i, 0 ≤ ι ≤ n - 1 where ajk ∈ {a11, a22, ···, ann}, λjk∈ σ(A) for A = [aij] > 0 IRn×n,using mixed determinants
Authors: Poramate Pranayanuntana, Pattrawut Chansangiam
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

We discuss the use of mixed determinant of special form D(A, n-i; I, i) for positive definite symmetric matrix A, in particular the operator concavity property of the map f : A ↦ D1/(n-i) (A, n-i; I, i)I together with unital positive linear map Φ : A ↦ A º I the Hadamard product of A with the identity matrix I, in deriving an inequality of the form Σ aj1 ... ajn-i ≥ Σ λj1 ... λjn-i, 0 ≤ i ≤ n - 1, where the sums are taken over all (n-i)-tuples of positive integers (j1, ..., jn-i) whose entries do not exceed n, with λjk and ajk, 1 ≤ k ≤ n from the set of all n positive eigenvalues of A and the set of main diagonal entries of A, respectively.
Directed cycles with chords
Authors: Daniel A. Marcus
Venue: Journal of Graph Theory (1999)

Using a variation of Thomassen's admissible triples technique, we give an alternative proof that every strongly 2-arc-connected directed graph with two or more vertices contains a directed cycle that has at least two chords, while at the same time establishing a more general result. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31:17&ndash;28, 1999
Fast enumeration algorithms for non-crossing geometric graphs
Authors: Naoki Katoh, Shin-ichi Tanigawa
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

A non-crossing geometric graph is a graph embedded on a given set of points in the plane with non-crossing straight line segments. In this paper we present a new general framework for enumerating non-crossing geometric graphs for a given point set. By applying our idea to specific enumeration problems, we obtain faster algorithms for enumerating plane straight-line graphs, non-crossing spanning connected graphs, non-crossing spanning trees and non-crossing minimally rigid frameworks. Furthermore, we also obtain efficient enumeration algorithms for non-crossing geometric graph classes, for which no enumeration algorithm has been reported so far, such as non-crossing matchings, non-crossing blue-and-red matchings, non-crossing k-vertex or k-edge connected graphs or non-crossing directed spanning trees. The proposed idea is relatively simple, and can be potentially applied to various other enumeration problems of non-crossing geometric graphs.
PNG1 triangles for tangent plane continuous surfaces on the GPU
Authors: Christoph Fünfzig, Kerstin Müller, Dianne Hansford, Gerald Farin
Venue: Proceedings of graphics interface 2008 (2008)

Improving the visual appearance of coarse triangle meshes is usually done with graphics hardware with per-pixel shading techniques. Improving the appearance at silhouettes is inherently hard, as shading has only a small influence there and the geometry must be corrected. With the new geometry shader stage released with DirectX 10, the functionality to generate new primitives from an input primitive is available. Also the shader can access a restricted primitive neighborhood. In this paper, we present a curved surface patch that can deal with this restricted data available in the geometry shader. A surface patch is defined over a triangle with its vertex normals and the three edge neighbor triangles. Compared to PN triangles, which define a curved patch using just the triangle with its vertex normals, our surface patch is G1 continuous with its three neighboring patches. The patch is obtained by blending two cubic B&eacute;zier patches for each triangle edge. In this way, our surface is especially suitable for efficient, high-quality tessellation on the GPU. We show the construction of the surface and how to add special features such as creases. Thus, the appearance of the surface patch can be fine-tuned easily. The surface patch is easy to integrate into existing polygonal modeling and rendering environments. We give some examples using Autodesk Maya.&reg;
Coloring edges of embedded graphs
Authors: Daniel P. Sanders, Yue Zhao
Venue: Journal of Graph Theory (2000)

In this paper, we prove that any graph G with maximum degree $\Delta(G)\geq(11+\sqrt{49-24_{\chi}(\Sigma)})/2$, which is embeddable in a surface &Sigma; of characteristic &chi;(&Sigma;) &le;&thinsp;1 and satisfies $|V(G)| > 2(\Delta(G)-5)-2\sqrt{6+\Delta(G)}$, is class one. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 197&ndash;205, 2000
Upper bound for the decay rate of the joint queue-length distribution in a two-node Markovian queueing system
Authors: Ken'Ichi Katou, Naoki Makimoto, Yukio Takahashi
Venue: Queueing Systems: Theory and Applications (2008)

This paper studies the geometric decay property of the joint queue-length distribution {p(n 1,n 2)} of a two-node Markovian queueing system in the steady state. For arbitrarily given positive integers c 1,c 2,d 1 and d 2, an upper bound $\overline{\eta}(c_{1},c_{2})$ of the decay rate is derived in the sense $$\exp\Bigl\{\limsup_{n\rightarrow\infty}n^{-1}\log p(c_{1}n+d_{1},c_{2}n+d_{2})\Bigr\}\leq\overline{\eta}(c_{1},c_{2}) It is shown that the upper bound coincides with the exact decay rate in most systems for which the exact decay rate is known. Moreover, as a function of c 1 and c 2, $\overline{\eta }(c_{1},c_{2})$ takes one of eight types, and the types explain some curious properties reported in Fujimoto and Takahashi (J. Oper. Res. Soc. Jpn. 39:525---540 [1996]).
Towards a rigorously justified algebraic preconditioner for high-contrast diffusion problems
Authors: Burak Aksoylu, Ivan G. Graham, Hector Klie, Robert Scheichl
Venue: Computing and Visualization in Science (2008)

In this paper we present a new preconditioner suitable for solving linear systems arising from finite element approximations of elliptic PDEs with high-contrast coefficients. The construction of the preconditioner consists of two phases. The first phase is an algebraic one which partitions the degrees of freedom into &#x201c;high&#x201d; and &#x201c;low&#x201d; permeability regions which may be of arbitrary geometry. This partition yields a corresponding blocking of the stiffness matrix and hence a formula for the action of its inverse involving the inverses of both the high permeability block and its Schur complement in the original matrix. The structure of the required sub-block inverses in the high contrast case is revealed by a singular perturbation analysis (with the contrast playing the role of a large parameter). This shows that for high enough contrast each of the sub-block inverses can be approximated well by solving only systems with constant coefficients. The second phase of the algorithm involves the approximation of these constant coefficient systems using multigrid methods. The result is a general method of algebraic character which (under suitable hypotheses) can be proved to be robust with respect to both the contrast and the mesh size. While a similar performance is also achieved in practice by algebraic multigrid (AMG) methods, this performance is still without theoretical justification. Since the first phase of our method is comparable to the process of identifying weak and strong connections in conventional AMG algorithms, our theory provides to some extent a theoretical justification for these successful algebraic procedures. We demonstrate the advantageous properties of our preconditioner using experiments on model problems. Our numerical experiments show that for sufficiently high contrast the performance of our new preconditioner is almost identical to that of the Ruge and St&#x00fc;ben AMG preconditioner, both in terms of iteration count and CPU-time.
Deep learning via semi-supervised embedding
Authors: Jason Weston, Frédéric Ratle, Ronan Collobert
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We show how nonlinear embedding algorithms popular for use with shallow semi-supervised learning techniques such as kernel methods can be applied to deep multilayer architectures, either as a regularizer at the output layer, or on each layer of the architecture. This provides a simple alternative to existing approaches to deep learning whilst yielding competitive error rates compared to those methods, and existing shallow semi-supervised techniques.
Modeling Languages Study and Evaluation Techniques
Authors: Ali Kamandi, Jafar Habibi
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Modeling languages are needed to describe the conceptual construct underlying software. Several modeling languages have been proposed during the last decades. In order to properly understand and assess software modeling languages, we believe that a set of techniques is needed. In this paper, we describe several techniques that can be applied for studying and evaluating cognitive complexity (comprehensibility) of software modeling languages. These techniques have been applied to human-computer interaction, human languages, programming languages and cognitive science before.
Copper cleaning in supercritical CO2 for the microprocessor interconnects
Authors: C. Ventosa, D. Rébiscoul, V. Perrut, V. Ivanova, O. Renault, G. Passemard
Venue: Microelectronic Engineering (2008)

In this study we report the efficiency of cleaning process in supercritical CO"2 for the removal of the post-etch residues and oxidized copper formed in the via after SiOC-based porous materials etching and photoresist plasma ashing processes. The cleaning solutions contain a sulfonic acid and chelating agents with different chemical configurations. X-ray reflectometry and scanning electron microscopy are used to estimate the oxidized copper dissolution and copper surface aspect (pitting corrosion and residues). The results show that the sulfonic acid dissolves cuprous oxide (Cu"2O) and copper hydroxide (Cu(OH)"2) and consequently allows to remove the residues located at the oxidized copper surface whereas the symmetric @b-diketones remove only the copper hydroxide. The mixture of sulfonic acid and @b-diketone does not lead to pits at the copper surface. This phenomenon could be due to a complex formation between copper and @b-diketones facilitating the oxidized copper dissolution by the acid or could be due to copper surface protection by the adsorbed @b-diketones.
Common sense knowledge and goal-oriented interfaces
Authors: Andrew S. Gordon, Catherine Havasi, Mathias Lux, Markus Strohmaier
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We present an overview of the workshop on Common Sense Knowledge and Goal-Oriented Interfaces held at the 2008 Intelligent User Interfaces conference. Six papers were accepted from diverse research groups, each offering innovative new research on interfaces that incorporate common sense knowledge and that are oriented around the goals of their users.
O2DSS: A Framework for Ontology-Based Decision Support Systems in Pervasive Computing Environment
Authors: Amin Saremi, Mostafa Esmaeili, Jaafar Habibi, Arman Ghaffari
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Applications in pervasive computing environment exploit information about the context of use, such as the location, tasks and preferences of the user, in order to adapt their behavior in response to changing operating environments and user requirements. Utilizing context with aid of ontology in data and model, decision support systems can provide better and more desirable support to their users. The effects and advantages of exploiting ontology in user modeling and DSS is discussed. We propose a framework of a Ontology-based Decision Support System (O2DSS), including ontology in model base, database and their advantages.
Efficient top-k querying over social-tagging networks
Authors: Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebastian Michel, Thomas Neumann, Josiane X. Parreira, Gerhard Weikum
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, personal blogs, bookmarks, and digital photos. These items can be annotated and rated by different users, and these social tags and derived user-specific scores can be leveraged for searching relevant content and discovering subjectively interesting items. Moreover, the relationships among users can also be taken into consideration for ranking search results, the intuition being that you trust the recommendations of your close friends more than those of your casual acquaintances. Queries for tag or keyword combinations that compute and rank the top-k results thus face a large variety of options that complicate the query processing and pose efficiency challenges. This paper addresses these issues by developing an incremental top-k algorithm with two-dimensional expansions: social expansion considers the strength of relations among users, and semantic expansion considers the relatedness of different tags. It presents a new algorithm, based on principles of threshold algorithms, by folding friends and related tags into the search space in an incremental on-demand manner. The excellent performance of the method is demonstrated by an experimental evaluation on three real-world datasets, crawled from deli.cio.us, Flickr, and LibraryThing.
A room with a cue: The efficacy of movement parallax, occlusion, and blur in creating a virtual window
Authors: Wijnand A. IJsselsteijn Willem Oosting, Ingrid M. L. C. Vogels, Yvonne A. W. de Kort, Evert van Loenen
Venue: Presence: Teleoperators and Virtual Environments (2008)

In indoor environments, having a view from a window plays an important role in human physical and psychological well-being---particularly if the view contains natural elements. In places where physical windows are absent or the view is highly artifact-dominated, virtual windows can potentially play a beneficial role. The current paper presents a research experiment on the efficacy of three monocular depth cues, that is, movement parallax, blur, and occlusion, in engendering a window-like “see-through experience” using projected photorealistic scenes. Results indicate that all three cues have a significant main effect on the viewer's see-through experience, with movement parallax yielding the greatest effect size. The effects of the remaining two cues are largely qualified by their interactions with each other and with movement parallax. These results provide a first step in identifying and testing the perceptual elements that are essential in creating a convincing virtual window.