ppxscal/embedding_network huggingface dataset:
A skill to reduce the calculation time involved during the quantum calculations of finite clusters' size
Authors: L. H. Mendoza Huizar
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In this paper we show the application of a new algorithm development by us to reduce the calculation time involved during the quantum calculations of finite clusters' size of copper, silver and gold in a common personal computer. The algorithm does an optimization of the nuclei coordinates (ONC), where the basis set functions are centered; diminishing the floating operations concerned during the quantum calculations. Employing this ONC, the calculation time in seconds is given by t=N2, where N is the number of atoms in the system. The electronic properties such as the electronic and gap energies, the HOMO's distribution and the Density of States at HF/LANL1MB, HF/LANL2DZ and B3LYP/LANL2DZ, keep the same values that when the algorithm is not employed, however a notable time reduction of the calculations is obtained. We have validated the ONC for big systems by performing a 182 gold atoms calculation at HF/LANL1MB level of theory. Employing the algorithm the calculation time is less than 10 hours while with out it the calculation time approximately corresponds to 3 months. It will be presented that the ONC keeps the accuracy of the basis set employing during the calculations.
ESPRIT Fundamentals 2007, 6th edition
Authors: Michael J Huggins, Monica L. Huggins
Venue:  (2007)

The 2007 ESPRIT Fundamentals training manual combines detailed descriptions of most commands within ESPRIT along with step-by-step instructions and saved files all of which make it easy to use ESPRIT to program a CNC machine. The manual provides even novice ESPRIT CAM users with the ability to reach a high level of proficiency with the software. President and CEO of Precision CAD/CAM Systems, Inc., Michael Huggins, stated this newest release in the series of ESPRIT CAM Training Manuals is the equivalent of a detailed blue print explaining everything you ever needed to know about ESPRIT 2007 CAM .
Measuring the risk-adjusted efficiency of Taiwan motor transport company before and after privatization
Authors: Hsun-Jung Cho, Chih-Ku Fan
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In this study a directional output distance function which incorporates both desirable and undesirable output is employed to investigate the impact of privatization experienced by the Taiwan Motor Transport Company (TMTC). For the first time, we measure efficiency changes before and after privatization while treating transport risk as a joint but undesirable output. The empirical results demonstrate that TMTC's privatization has produced a distinct improvement in efficiency enhancement and as such may be considered to be a source of cost reduction.
Computing minimal generators of integer matrix sequences (abstract only)
Authors: George Yuhasz, Erich Kaltofen
Venue: ACM Communications in Computer Algebra (2008)

We describe a fraction free matrix Berlekamp/Massey algorithm. The algorithm behaves like a scalar algorithm by performing block eliminations through multiplication by adjoint matrices. The adjoints are computed using fraction free diagonalization. We also describe an interesting classification of the unique minimal generators of a linearly generated scalar integer sequence. A counter example to the scalar theorem is given for linearly generated integer matrix sequences.
Technical Note: Mapping and forecasting of North Indian winter fog: an application of spatial technologies
Authors: S. Choudhury, H. Rajpal, A. K. Saraf, S. Panda
Venue: International Journal of Remote Sensing (2007)

In India, the Indo-Gangetic plain (part of Northern India) is invariably affected by dense fog in the winter months every year due to typical meteorological, environmental and prevailing terrain conditions. Pollution also plays an important role in the formation of fog (smoke+fog = smog) in India. Using National Oceanic and Space Administration-advanced very high resolution radiometer data the fog-affected regions in Northern India were delineated and the spatial extent of fog for the winter months of the years 2002-03, 2003-04 and 2004-05 (December-February) were studied and mapped. Forecast for future fog based on the analysis of satellite and meteorological (air temperature, relative humidity and wind speed) data was also done. The fog-affected areas were classified into maximum-fog-affected area, moderately fog-affected area and least fog-affected area. It has been found that in the winter months of the years 2002-03, 2003-04 and 2004-05, the fog-affected area in Northern India was about 867 000 km2, 625 000 km2 and 706 800 km2 respectively. The maximum fog-affected area was found to be 606 400 km2, the moderately fog-affected area was found to be 230 400 km2 and the least fog-affected area was found to be 404 500 km2. Further, based on meteorological parameters, such as temperature, humidity and wind speed along with elevation data was used to derive an approach for future fog prediction in this region.
Bisimulations in calculi modelling membranes
Authors: Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina
Venue: Formal Aspects of Computing (2008)

Bisimulations are well-established behavioural equivalences that are widely used to study properties of computer science systems. Bisimulations assume the behaviour of systems to be described as labelled transition systems, and properties of a system can be verified by assessing its bisimilarity with a system one knows to enjoy those properties. In this paper we show how semantics based on labelled transition systems and bisimulations can be defined for two formalisms for the description of biological systems, both capable of describing membrane interactions. These two formalisms are the Calculus of Looping Sequences (CLS) and Brane Calculi, and since they stem from two different approaches (rewrite systems and process calculi) bisimulation appears to be a good candidate as a general verification method. We introduce CLS and define a labelled semantics and bisimulations for which we prove some congruence results. We show how bisimulations can be used to verify properties by way of two examples: the description of the regulation of lactose degradation in Escherichia coli and the description of the EGF signalling pathway. We recall the PEP calculus (the simplest of Brane Calculi) and its translation into CLS, we define a labelled semantics and some bisimulation congruences for PEP processes, and we prove that bisimilar PEP processes are translated into bisimilar CLS terms.
Vectorized Matlab codes for linear two-dimensional elasticity
Authors: Jonas Koko
Venue: Scientific Programming (2007)

A vectorized Matlab implementation for the linear finite element is provided for the two-dimensional linear elasticity with mixed boundary conditions. Vectorization means that there is no loop over triangles. Numerical experiments show that our implementation is more efficient than the standard implementation with a loop over all triangles.
Numerical simulation of generalized second-grade fluids using a 1D hierarchical model
Authors: Fernando Carapau, Adélia Sequeira, João Janela
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

We consider the flow of a non-Newtonian incompressible second-grade fluid in an uniform rectilinear pipe and generalize it by introducing a shear-dependent viscosity function of power law type. The full 3D set of equations is reduced to a one-dimensional problem involving only time and one spatial variable. This is done using a director theory for fluid dynamics, also called Cosserat theory. An axisymmetric unsteady relationship between mean pressure gradient and volume flow rate over a finite section of the pipe and the corresponding equation to the wall shear stress are derived from this theory.
The Scale-rate as the Measure of Local Complexity of Medical Images
Authors: Xiaodong Zhuang, Hui Zhu, Liyan Xu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

For feature extraction in medical images, the scale-rate is proposed to represent local spatial or temporal complexity in medical images. The scale-rate is applied in automatic echocardiogram analysis. The experimental results show that the proposed method is effective and has promising application in automatic echocardiogram segmentation. Moreover, the directional spatial distribution of the scale-rate in medical images is investigated experimentally. The experimental results indicate that the scale-rate is a feature that represents edge areas in medical images.
A Taxonomy of Cluster-Based Routing Protocols for Wireless Sensor Networks
Authors: Anahit Martirosyan, Azzedine Boukerche, Richard Pazzi
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Recent advances in wireless sensor technologies have resulted in development of low cost and low power sensor nodes.Wireless Sensor Networks (WSNs) have increasingly been used for remotely monitoring tasks. Limited capabilities of sensor nodes in terms of communication, computation and storage, present challenges for protocols designed for WSNs. Due to the severe energy constraint of sensor nodes, among the major concerns is the problem of designing efficient energy-aware routing protocols. A large number of routing protocols has been proposed in the literature. They basically differ depending on the application and network architecture used in their design. Cluster-based routing protocols for large-scale WSNs have some advantages as compared to a flat network topology. Clustering results in a reduced number of messages that propagate through the network in order to accomplish a sensing task. It also offers an improved power control. In this paper, we present clustering energy-aware routing protocols for WSNs, highlight their features and present a comparison of the protocols' features.
On profiling blogs with representative entries
Authors: Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

With an explosive growth of blogs, information seeking in blogosphere becomes more and more challenging. One example task is to find the most relevant topical blogs against a given query or an existing blog. Such a task requires concise representation of blogs for effective and efficient searching and matching. In this paper, we investigate a new problem of profiling a blog by choosing a set of m most representative entries from the blog, where m is a predefined number that is application-dependent. With the set of selected representative entries, applications on blogs avoid handling hundreds or even thousands of entries (or posts) associated with each blog, which are updated frequently and often noisy in nature. To guide the process of selecting the most representative entries, we propose three principles, i.e., anomaly, representativeness, and diversity. Based on these principles, a greedy yet very efficient entry selection algorithm is proposed. To evaluate the entry selection algorithms, an extrinsic evaluation methodology from document summarization research is adapted. Specifically, we evaluate the proposed entry selection algorithms by examining their blog classification accuracies. By evaluating on a number of different classification methods, our empirical results showed that comparable classification accuracy could be achieved by using fewer than 20 representative entries for each blog compared to that of engaging all entries.
A model for describing and composing direction relations between overlapping and contained regions
Authors: Shihong Du, Luo Guo, Qiao Wang
Venue: Information Sciences: an International Journal (2008)

Current models of direction relations are not designed to describe direction information inside the Minimum Bounding Rectangle (MBR) of a reference region. Thus, the direction relations between overlapping and contained regions cannot be effectively described and derived. To resolve this problem, a new model of direction relations, namely interior-boundary direction relations, is proposed in this study to describe direction concepts relative to the interior or boundary of a region, such as ''east part of a region'', ''west border of a region'', ''a line goes through east part of a region'', and etc. By combining the interior and exterior direction relations, three types of compositions of direction relations are investigated: (1) composing two interior direction relations which can be used to derive the interior or exterior direction relations between two regions with the same parent region; (2) composing an interior direction relation with an exterior direction relation; and (3) composing an interior with an exterior direction relation. The results indicate that the new interior-boundary direction relations and its compositions with exterior direction relations are powerful in describing and deriving direction relations between overlapped and contained regions.
Implementation of Hardwired Distributive Tactile Sensing for Innovative Flexible Digit
Authors: Mohamad Iskandar Petra, David Holding, Peter Brett
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This paper focuses on the design of an efficient automated data interpretation system that is able to output its interpretation directly to describe the nature of contact with the tactile surface. The work integrates distributive tactile sensing technology, artificial neural networks (ANNs), and advanced FPGA-based application-specific real-time digital signal processing, to produce working systems for use in a steerable endoscope that retrieves shape and ‘touch’ information. Different configurations of the signal interpretation such as single and cascade neural networks were assessed. It was shown that the cascaded ANN architecture could achieve an overall accuracy of better than 94% when measuring clinically significant contact information. This technology has the potential to discriminate contact and palpation in minimal invasive surgery (MIS) tools.
Stateless distributed gradient descent for positive linear programs
Authors: Baruch Awerbuch, Rohit Khandekar
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We develop a framework of distributed and stateless solutions for packing and covering linear programs, which are solved by multiple agents operating in a cooperative but uncoordinated manner. Our model has a separate "agent" controlling each variable and an agent is allowed to read-off the current values only of those constraints in which it has non-zero coefficients. This is a natural model for many distributed applications like flow control, maximum bipartite matching, and dominating sets. The most appealing feature of our algorithms is their simplicity and polylogarithmic convergence. For the packing LP max{cx | Ax i = exp[1ε * (Aix/bi -1)] for each constraint i and each agent j iteratively increases (resp. decreases) xj multiplicatively if AjT y is too small (resp. large) as compared to cj. Our algorithm starting from a feasible solution, always maintains feasibility, and computes a (1+epsilon) approximation in poly((ln (mn A_max))ε) rounds. Here m and n are number of rows and columns of A and A_max, also known as the "width" of the LP, is the ratio of maximum and minimum non-zero entries Aij/(bicj). Similar algorithm works for the covering LP min{by | AT y >= c, y >= 0} as well. While exponential dual variables are used in several packing/ covering LP algorithms before [25, 9, 13, 12, 26, 16], this is the first algorithm which is both stateless and has polylogarithmic convergence. Our algorithms can be thought of as applying distributed gradient descent/ascent on a carefully chosen potential. Our analysis differs from those of previous multiplicative update based algorithms and argues that while the current solution is far away from optimality, the potential function decreases/increases by a significant factor.
An HDP-HMM for systems with state persistence
Authors: Emily B. Fox, Erik B. Sudderth, Michael I. Jordan, Alan S. Willsky
Venue: Proceedings of the 25th international conference on Machine learning (2008)

The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstrate some limitations of the original HDP-HMM formulation (Teh et al., 2006), and propose a sticky extension which allows more robust learning of smoothly varying dynamics. Using DP mixtures, this formulation also allows learning of more complex, multimodal emission distributions. We further develop a sampling algorithm that employs a truncated approximation of the DP to jointly resample the full state sequence, greatly improving mixing rates. Via extensive experiments with synthetic data and the NIST speaker diarization database, we demonstrate the advantages of our sticky extension, and the utility of the HDP-HMM in real-world applications.
The semismooth approach for semi-infinite programming under the Reduction Ansatz
Authors: Oliver Stein, Aysun Tezel
Venue: Journal of Global Optimization (2008)

We study convergence of a semismooth Newton method for generalized semi-infinite programming problems with convex lower level problems where, using NCP functions, the upper and lower level Karush-Kuhn-Tucker conditions of the optimization problem are reformulated as a semismooth system of equations. Nonsmoothness is caused by a possible violation of strict complementarity slackness. We show that the standard regularity condition for convergence of the semismooth Newton method is satisfied under natural assumptions for semi-infinite programs. In fact, under the Reduction Ansatz in the lower level and strong stability in the reduced upper level problem this regularity condition is satisfied. In particular, we do not have to assume strict complementary slackness in the upper level. Numerical examples from, among others, design centering and robust optimization illustrate the performance of the method.
Vocal control of a radio-controlled car
Authors: Adam J. Sporka, Pavel Slavík
Venue: Issue 91 (June 2008) (2008)

Increasing participation of the community of computer users with special needs in computer entertainment brings about the need for understanding the benefits and drawbacks of different assistive input techniques and devices that can be used for controlling the entertainment experience. Especially challenging is the support of the control of the arcade games, such as Tetris [7] or Breakout [2], where while only a limited number of game commands is required, the users must issue these in a rapid response to the evolving gameplay -- and many assistive devices are unable to cope with this problem. A promising set of techniques is provided by employing the voice as an input device.
Leveraging the potential of geospatial annotations for collaboration: a communication theory perspective
Authors: S. Hopfer, A. M. MacEachren
Venue: International Journal of Geographical Information Science (2007)

This paper addresses a key problem in the development of visual-analytical collaborative tools, how to design map-based displays to enable productive group work. We introduce a group communication theory, the Collective Information Sharing (CIS) bias, and discuss how it relates to communicative goals that need to be considered when designing collaborative, visually enabled, spatial-decision-support tools. The CIS bias framework suggests that key goals for developing such tools should be: (a) the harnessing of a group's collective knowledge emerging from collaborative discussions and (b) reducing the repeat of information that has already been shared within the group. We propose that web-accessible, map annotation tools are ideally suited to advancing these goals and outline how the CIS bias framework informs how geospatial annotation tools can maximize the potential of collaborative efforts. We offer design recommendations for annotation tools that function to: (a) facilitate access to and recall of geographically referenced discussion contributions, (b) document ideas for private as well as public discussion spaces, and (c) elicit all group members to contribute information in a given collaborative effort.
Managing home and access domains in modern broadband networks
Authors: Yves T'Joens, Tom Bostoen, Sven Van den Bosch, Piet Vandaele
Venue: Bell Labs Technical Journal (2008)

Broadband use is booming around the globe as the infrastructure is built to provide high speed Internet and Internet Protocol television (IPTV) services. Driven by fierce competition and the search for increasing average revenue per user (ARPU), operators are evolving so they can deliver services within the home that involve a wide range of technologies, terminals, and appliances, as well as software that is increasingly rich and complex. &ldquo;It should all work&rdquo; is the key theme on the end user's mind, yet call centers are confronted with a multitude of consumer problems. The demarcation point between provider network and home network is blurring, in fact, if not yet in the consumer's mind. In this context, operators need to significantly rethink service lifecycle management. This paper explains how home and access support systems cover the most critical part of the network in service delivery. They build upon the inherent operation support features of access multiplexers, network termination devices, and home devices to allow the planning, fulfillment, operation, and assurance of new services. &copy; 2008 Alcatel-Lucent.
XML-aided phrase indexing for hypertext documents
Authors: Miro Lehtonen, Antoine Doucet
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We combine techniques of XML Mining and Text Mining for the benefit of Information Retrieval. By manipulating the word sequence according to the XML structure of the marked-up text, we strengthen phrase boundaries so that they are more obvious to the algorithms that extract multiword sequences from text. Consequently, the quality of the indexed phrases improves, which has a positive effect on the average precision measured by the INEX 2007 standards.
Nonlinear Dynamics Techniques for the Detection of the Brain Areas Using MER Signals
Authors: Andrea Rodríguez-Sánchez, Edilson Delgado-Trejos, Álvaro Orozco-Gutiérrez, Germán Castellanos-Domínguez, Enrique Guijarro-Estellés
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

A methodology for identifying brain areas from the brain MER signals (microelectrode recordings) is presented, which is based on a nonlinear feature set. We propose nonlinear dynamics measures such as correlation dimension, Hurst exponent and the largest Lyapunov exponent to characterize the dynamic structure. The MER records belong to the Polytechnical University of Valencia, 24 records for each zone (black substance, thalamus, subthalamus nucleus and uncertain area). The detection of each area using characteristics derived from complexity analysis was obtained through a classifier (support vector machine). The joint information between areas is remarkable and the best accuracy result was 93.75%. The nonlinear dynamics techniques help to discriminate the four brain areas considered, since they take into account the intrinsic dynamics of the signals and the structures analysis based on the multivariate statistical procedures is an important step in the data preprocessing.