ppxscal/embedding_network huggingface dataset:
Value benefit analysis of technologies for ubiquitous computing to be implemented in the healthcare sector
Authors: Mike Krey
Venue: Proceedings of the 6th international workshop on Managing ubiquitous communications and services (2009)

The tasks and objectives of automatic identification (Auto-ID) are to provide information on goods and products. It has already been established for years in the areas of logistics and trading and can no longer be ignored by the German healthcare sector. Some German hospitals have already discovered the capabilities of Auto-ID. Improvements in quality, safety and reductions in risk, cost and time are aspects and areas where improvements are achievable. Privacy protection, legal restraints, and the personal rights of patients and staff members are just a few aspects which make the heath care sector a sensible field for the implementation of Auto-ID. Auto-ID in this context contains the different technologies, methods and products for the registration, provision and storage of relevant data. With the help of a quantifiable and science-based evaluation, an answer is sought as to which Auto-ID has the highest capability to be implemented in healthcare business.
Using common Lisp to prototype offline work in web applications for rich domains
Authors: Edgar E. M. Gonçalves, António Menezes Leitão
Venue: Proceedings of the 6th European Lisp Workshop (2009)

Web applications have been getting more and more attention from organizations as they seek out better infrastructures for their collaborative business processes. However, many tasks must be done while being offline, which goes against today's Web architecture that is based on a remote server that must be contacted for each performed operation. Development of this offline work isn't a one step operation, due to architectural differences from the traditional client-server approach. This makes both developing new applications and adapting existing ones a hard task. We describe a methodology to help perform such tasks. It centers on an adaptive data prefetching mechanism that will feed a suggestion producer on the server, so that a client may always ask for information it is probably going to need, according to statistical data. This solution differs from current data caching and prefetching systems by using an heuristic-based system to evaluate the situation the user is in, and providing dynamic content to the client. Another important result is the feedback a developer can extract from the suggestion maker: based on the suggestions efficiency, one can tell if the heuristics are being misused or if the functionality is poorly defined. We also describe a Common Lisp-based prototype implementation, called dshow, where we enhance a web server with our solution. We explain how the Common Lisp language features made the prototype development easier.
The MAP/PH/1/N queue with flows of customers as a model for traffic control in telecommunication networks
Authors: Chesoong Kim, Sergey Dudin, Valentina Klimenok
Venue: Performance Evaluation (2009)

A single-server queueing model with finite buffer and flows of customers is considered. Flow means a group of customers which should be sequentially processed in the system. In contrast to the standard batch arrival when a whole group of customers arrives into the system at one epoch, we assume that the customers of an accepted flow arrive one by one in exponentially distributed times. Service time has Phase type (PH) distribution. Generation of flows is described by the Markov Arrival Process (MAP). A flow consists of a random number of customers. This number is geometrically distributed and is not known at a flow arrival epoch. The number of flows, which can be admitted into the system simultaneously, is subject to control. Accepted flow can be lost, with a given probability, in the case of any customer from this flow rejection. Analysis of the joint distribution of the number of flows and customers in the system, flow loss probability and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes. The effect of control on the main performance measures of the system is demonstrated numerically. The influence of correlation in the arrival process of flows, variation of service time and probability of a flow loss in case of any customer from this flow rejection is illustrated.
Analysis of technical loss in distribution line system
Authors: Narong Mungkung, Nittaya Gomurut, Tanes Tanitteerapan, Somchai Arunrungrusmi, Weerachai Chaokumnerd, Toshifumi Yuji
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

This research was aimed to present Technical loss analysis in Hatyai of Provincial Electricity Authority (PEA). This Analysis used calculation and PSS/Adept program. For considering the technical loss in distribution system included: transmission line losses, power transformer losses, distribution line losses and low-voltage transformer and distribution line losses. The evaluation will be compared technical loss both 4 parts and compared technical loss from calculation and measurement which data included technical loss and technical loss. From this research found that low-voltage transformer and distribution line losses have maximum value at 78.72% and technical loss was at 3.33. So in controlling or decrease technical loss have to select appropriate and correctly method by must investigate both cost and most worthily.
Symbol occurrence probability vectors for syntax correction in automatic number plate recognition systems
Authors: Cristian Molder, Florin Serban, Iulian C. Vizitiu, Mihai I. Stanciu
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

Automatic number plate recognition systems (ANPR) are starting to be used in surveillance and access monitoring applications. They are mostly based on the detection of the number plate, the segmentation of characters and the optical character recognition. In most of the cases, because of the higher degree of generalization, the syntax is not an a priori element of those systems, therefore reducing the recognition rate. This paper presents new features used to improve the performances of ANPR system by using the country standard information in order to determine character/digit occurrences for each symbol position in the number plate. The proposed ANPR system is composed of three individual classifiers which perform different. In order to exploit their individual performance, trainable and non-trainable decision fusion rules are used. The syntax correction is implemented in the final stage of the system, as a feature vector for the decision fusion meta-classifier.
Initialisation of the adaptive Huber method for solving the first kind Abel integral equation
Authors: L. K. Bieniasz
Venue: Computing (2008)

In the previous work of this author (Bieniasz in Computing 83:25&#x2013;39, 2008) an adaptive numerical method for solving the first kind Abel integral equation was described. It was assumed that the starting value of the solution was known and equal zero. This is a frequent situation in some applications of the Abel equation (for example in electrochemistry), but in general the starting solution value is unknown and non-zero. The presently described extension of the method allows one to automatically determine both the starting solution value and the estimate of its discretisation error. This enables an adaptive adjustment of the first integration step, to achieve a pre-defined accuracy of the starting solution. The procedure works most satisfactorily in cases when the solution possesses all, or at least several of the lowest, derivatives at the initial value of the independent variable. Otherwise, a discrepancy between the true and estimated errors of the starting solution value may occur. In such cases one may either start integration with as small step as possible, or use a smaller error tolerance at the first step.
Key consumer group for late comers in network effect product market: a multi-agent modeling approach
Authors: Zhou Geng
Venue: Proceedings of the 2nd conference on European computing conference (2008)

The first movers in network effect market enjoy the first-mover advantages. However, through proper strategy, late comers still hold a chance to win the competition. I divide the consumers into 5 categories and simulate the market with multi-agent modeling method. The result shows that the active nonrational group is the most important consumer group for the late comers. I also provide two case studies of China's blog service market and China's online game market in this paper.
Sequential-adaptive design of computer experiments for the estimation of percentiles
Authors: William I. Notz
Venue:  (2008)

In the study of complex physical and engineering processes, it is sometimes either impossible, infeasible or very expensive to observe the actual systems. When such situations arise, computer simulators or codes can be used instead. Often these codes are very complex, requiring many hours or days for a single simulation, and thus the number of times we may implement the code to collect data needs to be as small as possible. The running of such a code at a few chosen input settings comprises a computer experiment. Most of the work done in this area focuses on either estimating the unknown complex input-output relationship or optimizing the output. This thesis considers the problem of percentile estimation in a computer experiments setting. The input variables are assumed to be independently distributed with known distributions. The output variable is assumed to be related to the input variables through a complex unknown function. Our goal is to estimate, say, the pth percentile &zeta;p, of the induced distribution of the output variable. To achieve this, we propose a sequential-adaptive design algorithm. The responses on the output variable are modeled as realizations of a Gaussian stochastic process. Based on the fitted model, new design sites are selected and added to the existing design. The final set of design points are used to estimate the pth percentile &zeta;p. The proposed criteria that are used to select new design sites can be thought of as being inspired by the two concepts of statistical inference: confidence interval and hypothesis testing. We present the results obtained from using the sequential-adaptive design methodology, and compare these results to those obtained from fixed design methods. We also discuss the cases of constrained percentile estimation, and percentile estimation of integrated response functions.
A Heuristic Strong Connectivity Algorithm for Large Graphs
Authors: Adan Cosgaya-Lozano, Norbert Zeh
Venue: Proceedings of the 8th International Symposium on Experimental Algorithms (2009)

We present a contraction-based algorithm for computing the strongly connected components of large graphs. While the worst-case complexity of the algorithm can be terrible (essentially the cost of running a DFS-based internal-memory algorithm on the entire graph), our experiments confirm that the algorithm performs remarkably well in practice. The strongest competitor is the algorithm by Sibeyn et al. [17], which is based on a semi-external DFS algorithm developed in the same paper. Our algorithm substantially outperforms the algorithm of [17] on most of the graphs used in our experiments and never performs worse. It thus demonstrates that graph contraction, which is the most important technique for solving connectivity problems on undirected graphs I/O-efficiently, can be used to solve such problems also on directed graphs, at least as a heuristic.
Using Toe-Off Impulse to Control Chaos in the Simplest Walking Model via Artificial Neural Network
Authors: Saeed Jamali, Karim Faez, Sajjad Taghvaee, Mostafa Ozlati Moghadam
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

Controlling chaos in a passive biped robot with an artificial neural network is investigated in this paper. The dynamical model is based on the compass-like biped robot proposed by Garcia et al. (1998) with a point-mass at the hip and infinitesimal point-masses at the feet ignoring the scuffing situation. The governing dynamics and chaotic behavior of the system is explored and the bifurcation diagram is drawn with respect to the ramp slope. Controlling chaos is based on stabilizing the unstable periodic orbits in the chaotic attractor. The UPOs are detected using an iterated algorithm. The artificial neural network is constructed using the information of seven previous steps and the control parameters in each one. The network is trained to find the appropriate control parameter in order to put the next step on the unstable periodic orbit. The control parameter is the toe-off impulse at the heel strike.
Tool, Toy, Telephone, Territory, or Treasure of Information: Elementary school students' attitudes toward the Internet
Authors: Chien Chou, Sen-chi Yu, Chao-hsiu Chen, Huan-Chueh Wu
Venue: Computers Education (2009)

The purposes of this study are to investigate fifth-graders' attitudes toward the Internet based on the 5-T framework (Tool, Toy, Telephone, Territory, and Treasure of Information), and to understand whether gender makes any difference in their attitudes. The data were obtained from 2,253 Taiwan fifth-grade students. Through a confirmatory factor analysis, the 5-T model was validated and can be used to explain the corresponding five-factors which constitute Internet attitudes. According to the results, the students perceived the Internet mainly as a useful and powerful tool for their academic work and daily lives. Moreover, students strongly considered the Internet a toy, which is somewhat indistinguishable from the role of Tool. The students acknowledged the role of the Territory that they can demonstrate themselves by writing and sharing personal information online. Therefore, the Internet is good for both reading and writing information. The least weighted factor among 5-Ts student recognized is the role of Telephone. Gender differences exist in the subscales of Tool, Toy, Treasure of Information, and Telephone, but not in the Territory subscale of the Internet attitudes scale. This study further discusses and presents implications of the findings for teachers, parents, and future studies.
Feature detection algorithms in computed images
Authors: James H. Mcclellan
Venue:  (2008)

The problem of sensing a medium by several sensors and retrieving interesting features is a very general one. The basic framework is generally the same for applications from MRI, tomography, Radar SAR imaging to subsurface imaging, even though the data acquisition processes, sensing geometries and sensed properties are different. In this thesis we introduced a new perspective to the problem of remote sensing and information retrieval by studying the problem of subsurface imaging using GPR and seismic sensors.We have shown that if the sensed medium is sparse in some domain then it can be imaged using many fewer measurements than required by the standard methods. This leads to much lower data acquisition times and better images. We have used the ideas from Compressive Sensing, which show that a small number of random measurements about a signal are sufficient to completely characterize it, if the signal is sparse or compressible in some domain. Although we have applied our ideas to the subsurface imaging problem, our results are general and can be extended to other remote sensing applications.A second objective in remote sensing is information retrieval which involves searching for important features in the computed image. In this thesis we focus on detecting buried structures like pipes, and tunnels in computed GPR or seismic images. The problem of finding these structures in high clutter and noise conditions, and finding them faster than the standard shape detecting methods is analyzed. One of the most important contributions of this thesis is where the sensing and the information retrieval stages are unified in a single framework using compressive sensing. Instead of taking lots of standard measurements to compute the image of the medium and search the necessary information in the computed image, only a small number of measurements as random projections are used to infer the information without generating the image of the medium.
KISS: Stochastic Packet Inspection
Authors: Alessandro Finamore, Marco Mellia, Michela Meo, Dario Rossi
Venue: Proceedings of the First International Workshop on Traffic Monitoring and Analysis (2009)

This paper proposes KISS, a new Internet classification method. Motivated by the expected raise of UDP traffic volume, which stems from the momentum of P2P streaming applications, we propose a novel statistical payload-based classification framework, targeted to UDP traffic.Statistical signatures are automatically inferred from training data, by the means of a Chi-Square like test, which extracts the protocol "syntax", but ignores the protocol semantic and synchronization rules. The signatures feed a decision engine based on Support Vector Machines. KISS is tested in different scenarios, considering both data, VoIP, and traditional P2P Internet applications. Results are astonishing. The average True Positive percentage is 99.6%, with the worst case equal 98.7%. Less than 0.05% of False Positives are detected.
Spectrum of a complex network of Euler-Bernoulli beams
Authors: KuiTing Zhang, Gen Qi Xu, Nikos E. Mastorakis
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

In this paper we study a network of Euler-Bernoulli beams. Suppose the exterior vertices are clamped and the edges are connected under the condition that the rotation is not continuous at the interior vertices. The well-posedness of the closed loop system is proved by the semigroup theory. By spectral analysis of the system operator, we show that the system is asymptotically stable under certain condition. By a detail analysis of spectrum, we prove the Riesz basis property of the eigenvectors of the system operator.
MAMS service framework
Authors: Thomas Konnerth, Silvan Kaiser, Alexander Thiele, Jan Keiser, Dai Labor
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In this paper we describe the service platform for the MAMS framework which is an agent based platform for the creation, deployment and execution of service compositions created by non-IT-experts. Our platform provides a flexible service execution environment, which utilises agent technology to improve scalability, platform & service management and stability.
Supporting Training on a Robotic Simulator using a Flexible Path Planner
Authors: Roger Nkambou, Khaled Belghith, Froduald Kabanza, Mahie Khan
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Manipulating the Space Station Remote Manipulator (SSRMS) on the International Space Station (ISS) is a very challenging task. The operator does not have a direct view of the scene of operation and must rely on cameras mounted on the manipulator and at strategic places of the environment where it operates. In this paper, we describe how a new approach for robot path planning called FADPRM can be used to support the training of astronauts on such a manipulator and under this big constraint of restricted sight.
Exploring Python, 1st edition
Authors: Timothy Budd
Venue:  (2009)

Exploring Python takes an active learning approach which engages the student as an equal partner in the process of learning the fun, educational, and powerful programming language. This approach instills habits that students will carry with them throughout their programming career and helps them retain and use the information they have learned.. . Tim Budd is one of the best-known authors in Computer Science and has a reputation for producing writing texts along the leading edge of the discipline. Exploring Python provides an accessible and reliable introduction into programming with the Python language.
Efficient exact motif discovery
Authors: Tobias Marschall, Sven Rahmann
Venue: Bioinformatics (2009)

Motivation: The motif discovery problem consists of finding over-represented patterns in a collection of biosequences. It is one of the classical sequence analysis problems, but still has not been satisfactorily solved in an exact and efficient manner. This is partly due to the large number of possibilities of defining the motif search space and the notion of over-representation. Even for well-defined formalizations, the problem is frequently solved in an ad hoc manner with heuristics that do not guarantee to find the best motif. Results: We show how to solve the motif discovery problem (almost) exactly on a practically relevant space of IUPAC generalized string patterns, using the p-value with respect to an i.i.d. model or a Markov model as the measure of over-representation. In particular, (i) we use a highly accurate compound Poisson approximation for the null distribution of the number of motif occurrences. We show how to compute the exact clump size distribution using a recently introduced device called probabilistic arithmetic automaton (PAA). (ii) We define two p-value scores for over-representation, the first one based on the total number of motif occurrences, the second one based on the number of sequences in a collection with at least one occurrence. (iii) We describe an algorithm to discover the optimal pattern with respect to either of the scores. The method exploits monotonicity properties of the compound Poisson approximation and is by orders of magnitude faster than exhaustive enumeration of IUPAC strings (11.8 h compared with an extrapolated runtime of 4.8 years). (iv) We justify the use of the proposed scores for motif discovery by showing our method to outperform other motif discovery algorithms (e.g. MEME, Weeder) on benchmark datasets. We also propose new motifs on Mycobacterium tuberculosis. Availability and Implementation: The method has been implemented in Java. It can be obtained from http://ls11-www.cs.tu-dortmund.de/people/marschal/paa_md/ Contact:tobias.marschall@tu-dortmund.de; sven.rahmann@tu-dortmund.de
Natural Language Generation for Intelligent Tutoring Systems: a case study
Authors: Barbara di Eugenio, Davide Fossati, Dan Yu, Susan Haller, Michael Glass
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

To investigate whether Natural Language feedback improves learning, we developed two different feedback generation engines, that we systematically evaluated in a three way comparison that included the original system as well. We found that the system which intuitively produces the best language does engender the most learning. Specifically, it appears that presenting feedback at a more abstract level is responsible for the improvement.