ppxscal/embedding_network huggingface dataset:
Using DecisionTrees for Real-Time Ischemia Detection
Authors: Lacramioara Dranca, Alfredo Goni, Arantza Illarramendi
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

In this paper we investigate if techniques based on decision trees are also useful to classify ischemia. In order to do that, we have based on a previous own algorithm that is able of detecting ST-segment episodes, can be executed in real time and is lightweight enough to be implemented on mobile devices such as PDAs. Three main steps are performed by that algorithm: 1) signal preprocessing that extracts important features from the ECG signal 2) detection of suspect ST segment events and 3) rejection of irrelevant ST segment events. We have found that techniques based on decision trees are interesting for the last step in order to obtain a set of rules that reject some of the suspect ST segment events detected in the second step. The freely available part of the LTST database has been used to develop the detector and the rest of the same database has been used for validation purposes. The sensitivity of the detector over all the records of the LTST database is 89.89% for episodes annotated according to C protocol and the positive predictivity is 70.03% for episodes annotated according to A protocol. Those results improve our previously obtained ones and we think that they are comparable to other results that appear in the literature. However, it has to be noticed that we have not found works that detect ischemia in real time and show validation results over the LTST database.
True Images: A Calibration Technique to Reproduce Images as Recorded
Authors: Corey Manders, Steve Mann
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

When the user of a digital camera records an image, there is some presumption that when displayed, there is an accurate tonal representation. However, this is almost never the case. The paper shows how capture and tonal reproduction of an image rarely match, as well as a brief history as to why this is true. Techniques for calibrating digital cameras tonally as well as calibrating viewing devices are presented. The paper demonstrates a method of recovering camera response curves easily and with precision. Monitor calibration is demonstrated in a means that allows an accurate display of light-linear images. Ultimately, the paper shows how the proposed methods of calibration for digital cameras and display devices results in the accurate representation of images.
Modeling and simulation of a hybrid dynamic system used in haptic interfaces
Authors: F. Khatounian, S. Moreau, J. P. Louis, E. Monmasson, F. Louveau, J. M. Alexandre
Venue: Mathematics and Computers in Simulation (2006)

A haptic system consists of an articulated mechanical structure with motors and position sensors, as well as embedded electronics allowing force feedback. It is driven by a haptic interface, which enables the user to interact with an image in a virtual reality application, through the sense of touch. Thus, it is a hybrid dynamic system, which contains subsystems with continuous dynamics and subsystems with discrete dynamics that interact with each other. This paper develops a hybrid dynamic system model of the system, which takes into account the different sampling periods of the desired regulation, and the interaction between continuous, switching and discrete subsystems. It is interesting when very short electrical transients coexist with very long mechanical ones.
Towards Timely ACID Transactions in DBMS
Authors: Marco Vieira, Antonio Casimiro Costa, Henrique Madeira
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

On time data management is becoming a key difficulty faced by organizations. In spite of the importance of timeliness requirements in database applications, commercial DBMS do not assure the detection of the cases when a transaction takes longer than the expected/ desired time. This paper discusses the problem of timing failure detection in database applications and proposes a transaction programming approach to help developers in programming database applications with time constraints.
A simulation environment for the redesign of food supply chain networks: modeling quality controlled logistics
Authors: Jack G. A. J. van der Vorst, Seth Tromp, Durk-Jouke van der Zee
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Nowadays, many industries are confronted with intensified global competition as well as advances in information and process technology. They create both the need and opportunity for a coordinated approach of industrial partners to establish effective and efficient supply chains. Simulation tools are often used for supporting decision-making on supply chain (re)design, building on their inherent modeling flexibility. However, food supply chains set some specific requirements to simulation models. To address these demands a new discrete event simulation environment called ALADIN has been developed. It is based on a generic modeling framework that offers the analyst guidance in modeling, and provides model transparency to problem owners. An essential feature of the new tool concerns the integration of reusable process building blocks and quality decay models enabling "Quality Controlled Logistics". A case example concerning a supply chain for peppers is presented to illustrate the applicability and advantages of the tool.
Ontologizing B2B Message Specifications: Experiences from Adopting the PLIB Ontology for Commercial Product Data
Authors: Joerg Leukel, Martin Hepp, Volker Schmitz, Christoph Tribowski
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Data about products and services is of paramount importance in most inter-organizational business processes. For business-to-business (B2B) scenarios, a great number of XML-based message specifications are available, which cover various processes and types of transactions. These specifications support the respective data exchange tasks by providing a common representation for products and services in the form of syntactical conventions with some light-weight formal semantics. However, an analysis of the underlying models shows that technical product data and commercial product data are being represented in a fundamentally different manner. In particular show the commercial models both a higher syntactical complexity and more semantic heterogeneity. In this paper, we propose to align the representation of technical and commercial views on product data in message specifications. Our approach is based on the PLIB ontology, which was originally described in ISO 13584. We have evaluated our proposal by applying it to an industrial message specification for electronic catalogs, and can show that the novel approach reduces representational mismatches in B2B processes and simplifies systems integration in such scenarios.
On stability analysis of multiple objective dynamic input-output model
Authors: P. Zhou, L. W. Fan, H. W. Tang
Venue: Applied Mathematics and Computation (2006)

The popularity of multiple objective dynamic input-output (MODIO) models in real application was much restricted by their instabilities. In this paper we investigate the mechanism of the instability of the original MODIO models theoretically and develop a modified MODIO model in virtue of the idea of goal programming. It is shown that the proposed model is stable while remaining the characteristics of the original MODIO models.
SODA: Service Oriented Device Architecture
Authors: Scott de Deugd, Randy Carroll, Kevin Kelly, Bill Millett, Jeffrey Ricker
Venue: IEEE Pervasive Computing (2006)

Leveraging existing and emerging standards from both the embedded device and the IT domains, within a Service Oriented Device Architecture (SODA) can eliminate much of the "accidental" complexity and cost associated with integrating devices into highly distributed enterprise systems.
Attention and Interhemispheric Transfer: A Behavioral and fMRI Study
Authors: B. Weber, V. Treyer, N. Oberholzer, T. Jaermann, P. Boesiger, P. Brugger, M. Regard, A. Buck, S. Savazzi, C. A. Marzi
Venue: Journal of Cognitive Neuroscience (2005)

When both detections and responses to visual stimuli are performed within one and the same hemisphere, manual reaction times (RTs) are faster than when the two operations are carried out in different hemispheres. A widely accepted explanation for this difference is that it ref lects the time lost in callosal transmission. Interhemispheric transfer time can be estimated by subtracting RTs for uncrossed from RTs for crossed responses (crossed &ndash; uncrossed difference, or CUD). In the present study, we wanted to ascertain the role of spatial attention in affecting the CUD and to chart the brain areas whose activity is related to these attentional effects on interhemispheric transfer. To accomplish this, we varied the proportion of crossed and uncrossed trials in different blocks. With this paradigm subjects are likely to focus attention either on the hemifield contralateral to the responding hand (blocks with 80% crossed trials) or on the ipsilateral hemifield (blocks with 80% uncrossed trials). We found an inverse correlation between the proportion of crossed trials in a block and the CUD and this effect can be attributed to spatial attention. As to the imaging results, we found that in the crossed minus uncrossed subtraction, an operation that highlights the neural processes underlying interhemispheric transfer, there was an activation of the genu of the corpus callosum as well as of a series of cortical areas. In a further commonality analysis, we assessed those areas which were activated specifically during focusing of attention onto one hemifield either contra- or ipsilateral to the responding hand. We found an activation of a number of cortical and subcortical areas, notably, parietal area BA 7 and the superior colliculi. We believe that the main thrust of the present study is to have teased apart areas important in interhemispheric transmission from those involved in spatial attention.
Analysis of software test item generation: comparison between high skilled and low skilled engineers
Authors: Masayuki Hirayama, Osamu Mizuno, Tohru Kikuno
Venue: Journal of Computer Science and Technology (2005)

Recent software system contain many functions to provide various services. According to this tendency, it is difficult to ensure software quality and to eliminate crucial faults by conventional software testing methods. So taking the effect of test engineer's skill on test item generation into consideration, we propose a new test item generation method, which supports the generation of test items for illegal behavior of the system. The proposed method can generate test items based on use-case analysis, deviation analysis for legal behavior, and faults tree analysis for system fault situations. From the results of the experimental applications of our method, we confirmed that test items for illegal behavior of a system were effectively generated, and also the proposed method could effectively assist test item generation by an engineer with low-level skill.
Combining Greedy Method and Genetic Algorithm to Identify Transcription Factor Binding Sites
Authors: Wanyu Wang, Xiaoyu Chang, Chunguang Zhou
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Identification of Transcription Factor Binding Sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a novel approach to identify transcription factor binding sites. This approach combines greedy method and genetic algorithm (CGGA) to search conserved segment in the given sequence set. A new greedy method which can efficiently search a local optimal result is proposed. In order to solve the high complexity of this algorithm, we also give an effective improvement for this method. Then, we describe how to combine genetic algorithm with this greedy method to find the more optimal results. Greedy method is combined to the fitness function of the genetic algorithm. We apply this approach on two different TFBS sets and the results show that it can find correct result both effective and efficient, and for CRP binding sites, it get a more accurate result than Gibbs Sampler, AlignACE and MDGA.
Do generational schemes improve the garbage collection efficiency?
Authors: W. Srisa-an
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

Recently, most research efforts on garbage collection have concentrated on reducing pause times. However, very little effort has been spent on the study of garbage collection efficiency, especially generational garbage collection which was introduced as a way to reduce garbage collection pause times. In this paper a detailed study of garbage collection efficiency in generational schemes is presented. The study provides a mathematical model for the efficiency of generation garbage collection. Additionally, important issues such as write-barrier overhead, pause times, residency, and heap size are also addressed. We find that generational garbage collection often has lower garbage collection efficiency than other approaches (e.g. mark-sweep, copying) due to a smaller collected area and write-barrier overhead.
Stress testing a supply chain using simulation
Authors: Sanjay Jain, Swee Leong
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Simulation provides the capability to evaluate performance of a system operating under current or proposed configurations, policies and procedures. It is very applicable to evaluation of strategic and operational level plans for supply chains. It is especially useful for exploring the viability of a supply chain before beginning production. This paper describes the use of simulation for determining the readiness of a supply chain designed by a small company for providing sub-systems to a defense contractor. The supply chain had to be stress tested at surge and mobilization volume levels to meet the requirements. Simulation provided the ideal methodology to identify and demonstrate the behavior of the supply chain under stress and evaluate strategies to meet the defined volumes. It was used to prove the readiness of the supply chain reducing perceived risks in using the virtual operation.
Mapping of Fault-Tolerant Applications with Transparency on Distributed Embedded Systems*
Authors: Viacheslav Izosimov, Paul Pop, Petru Eles, Zebo Peng
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

In this paper we present an approach for the mapping optimization of fault-tolerant embedded systems for safetycritical applications. Processes and messages are statically scheduled. Process re-execution is used for recovering from multiple transient faults. We call process recovery transparent if it does not affect operation of other processes. Transparent recovery has the advantage of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules. However, it will introduce additional delays that can lead to violations of the timing constraints of the application. We propose an algorithm for the mapping of fault-tolerant applications with transparency. The algorithm decides a mapping of processes on computation nodes such that the application is schedulable and the transparency properties imposed by the designer are satisfied. The mapping algorithm is driven by a heuristic that is able to estimate the worst-case schedule length and indicate whether a certain mapping alternative is schedulable.
Real and Imaginary Rotary Motion Processing: Functional Parcellation of the Human Parietal Lobe Revealed by fMRI
Authors: Katherine Podzebenko, Gary F. Egan, John D.G. Watson
Venue: Journal of Cognitive Neuroscience (2005)

Functional magnetic resonance imaging was performed in 16 healthy subjects while they undertook orientation discrimination tasks of real rotating and mentally rotating alphanumeric characters. Perception of rotating and stationary abstract characters was also performed. Mental rotation and the perception of alphanumeric characters undergoing real rotation activated equivalent cortical areas, in keeping with the analogue hypothesis of mental rotation. In addition, areas along the dorsal stream, including the V5/middle temporal complex and the intraparietal sulcus (IPS ), were activated during both the real and imaginary rotary conditions. Within the parietal lobe there were areas of convergence (i.e., recruited by all three motion conditions) and areas of divergence (i.e., selectively activated by a particular condition). Tasks requiring canonical-mirror orientation discrimination revealed involvement of neural substrates localized to the ventrolateral bank of the IPS. Tasks in which this judgment was not performed and during which the subject viewed rotary motion of abstract stimuli recruited activity in the medial bank of the IPS. These results indicate subspecialization of the human posterior parietal lobe according to function.
Two new subjective validation methods using data displays
Authors: Husam Hamad, Sami Al-Hamdan
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Three graphical data displays of histograms, box plots, and behavior plots are used in existing literature for subjective model validation. In this paper, we present two additional plots that can be used for displaying graphs of data; these are the so-called circle plots and ordinal plots. These plots are easy to generate using model data and system data. Like the existing plot types, no statistical assumptions are made on the data that are represented. However, more expeditious subjective interpretations about model operational validity are made using the methods presented.
Gabor Binary Codes for Face Recognition
Authors: Lianghua He, Die Hu, Changjun Jiang
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

There are many challenges in face recognition task, such as illumination, facial expression and accessory etc. in this paper, an novel method, called Gabor Binary Code (GBC) is introduced to extract robustness features for face recognition against these disturbance. At first, the original gray images was convoluted with a series of Gabor Wavelet jets and got the corresponding Gabor Magnitude Pictures (GMP), then the GBC will be constructed by these GMP under the basic idea of Local Binary Pattern (LBP). Because of containing both the information of local texture and block gray varying, GBC features are overwhelming comparing with Local Binary Patterns(LBP), Gavor Wavelet and Independent Component Analysis(ICA) methods. Series of experimental results show that it has improve the recognition rate greatly even in bad condition.
How Much Software Quality Investment Is Enough: A Value-Based Approach
Authors: LiGuo Huang, Barry Boehm
Venue: IEEE Software (2006)

A classical problem facing many software projects is determining when to stop testing and release the product for use. Risk analysis helps address this issue by balancing the risk exposure of doing too little with the risk exposure of doing too much. A quantitative approach based on the COCOMO II cost-estimation model and the COQUALMO quality-estimation model helps answer the question, "How much software quality investment is enough?" The authors use the models and some representative empirical data to assess the relative payoff of value-based testing as compared to value-neutral testing. They include examples of the approach's use under differing value profiles.
Binary pathfinder: an improvement to the pathfinder algorithm
Authors: Vicente P. Guerrero-Bote, Felipe Zapico-Alonso, María Eugenia Espinosa-Calvo, Rocío Gómez Crisóstomo, Félix de Moya-Anegón
Venue: Information Processing and Management: an International Journal (2006)

The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis of, amongst others, citations in BIS (bibliometrics, informetrics, and scientometrics). It has even been proposed for the online display of the search results in an information retrieval system. However, its great time and space complexity limits its use in real-time applications and in networks of any considerable size.The present work describes an improved algorithm with considerably reduced time and space complexity. Its lower execution costs thus increase its applicability both in real time and to large networks.
A Learning Objects Recommendation Model based on the Preference and Ontological Approaches
Authors: Kun Hua Tsai, Ti Kai Chiu, Ming Che Lee, Tzone I. Wang
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

With vigorous development of Internet, especially the web page interaction technology, distant e-learning has become more and more realistic and popular. Digital courses may consist of many learning units or learning objects and, currently, many learning objects are created according to SCORM standard. It can be seen that, in the near future, a vast amount of SCORM-compliant learning objects will be published and distributed cross the Internet. Facing the huge volume of learning objects, learners will be lost in selecting suitable and favorite learning objects. In this paper an adaptive personalized ranking mechanism is proposed to help recommend SCORM-compliant learning objects from repositories in the Internet. The mechanism uses both preference-based and neighbor-interest-based approaches in ranking the degree of relevance of learning objects to a user's intension. By this model, a tutoring system is able to provide easily and efficiently for active learners suitable learning objects.
Stuart J. Norcross
Authors: Stuart J. Norcross, Alan Dearle, Graham N. C. Kirby, Scott M. Walker
Venue: Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (2005)

This paper describes an infrastructure for the deployment and use of Web Services that are resilient to the failure of the nodes that host those services. The infrastructure presents a single interface that provides mechanisms for users to publish services and to find hosted services. The infrastructure supports the autonomic deployment of services and the brokerage of hosts on which services may be deployed. Once deployed, services are autonomically managed in a number of aspects including load balancing, availability, failure detection and recovery, and lifetime management. Services are published and deployed with associated metadata describing the service type. This same metadata may be used subsequently by interested parties to discover services. The infrastructure uses peer-to-peer (P2P) overlay technologies to abstract over the underlying network to deploy and locate instances of those services. It takes advantage of the P2P network to replicate directory services used to locate service instances (for using a service), Service Hosts (for deployment of services) and Autonomic Managers which manage the deployed services. The P2P overlay network is itself constructed using novel Web services-based middleware and a variation of the Chord P2P protocol, which is self-managing.