ppxscal/embedding_network huggingface dataset:
Interactive Visual Analysis of Perfusion Data
Authors: Steffen Oeltze, Helmut Doleisch, Helwig Hauser
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Perfusion data are dynamic medical image data which characterize the regional blood flow in human tissue. These data bear a great potential in medical diagnosis, since diseases can be better distinguished and detected at an earlier stage compared to static image data. The wide-spread use of perfusion data is hampered by the lack of efficient evaluation methods. For each voxel, a time-intensity curve characterizes the enhancement of a contrast agent. Parameters derived from these curves characterize the perfusion and have to be integrated for diagnosis. The diagnostic evaluation of this multi-field data is challenging and time-consuming due to its complexity. For the visual analysis of such datasets, feature-based approaches allow to reduce the amount of data and direct the user to suspicious areas. We present an interactive visual analysis approach for the evaluation of perfusion data. For this purpose, we integrate statistical methods and interactive feature specification. Correlation analysis and Principal Component Analysis (PCA) are applied for dimensionreduction and to achieve a better understanding of the inter-parameter relations. Multiple, linked views facilitate the definition of features by brushing multiple dimensions. The specification result is linked to all views establishing a focus+context style of visualization in 3D. We discuss our approach with respect to clinical datasets from the three major application areas: ischemic stroke diagnosis, breast tumor diagnosis, as well as the diagnosis of the coronary heart disease (CHD). It turns out that the significance of perfusion parameters strongly depends on the individual patient, scanning parameters, and data pre-processing.
A User context awareness Model for mobile environment processing
Authors: Hyogun Yoon, Eungyeong Kim, Malrey Lee
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Context resources that users and sensors have within an area are heterogeneous in structure, so they are insufficient for monitoring the situation of moving users. In addition, portable mobile devices usually have a limited processing capacity for processing a large volume of context resources. The present study defines context structure for recognizing dynamic changes in users' environment and proposes a model for processing users' situation. The proposed context structure distinguishes between dynamic and static contexts according to the volume of context change, and defines correlations among objects. Therefore, users' situation can be inferred using ontology.
Query expansion through geographical feature types
Authors: Nuno Cardoso, Mário J. Silva
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

This paper introduces a new approach for expansion of queries with geographical context. The proposed strategy is based on a query parser that captures geonames and spatial relationships, and maps geographical features and feature types into concepts of a geographical ontology. Different strategies for query expansion, according to the geographical restrictions given by the user, are compared. The proposed method allows a more versatile and focused expansion towards the geographical information need of the user.
A Method of Proximity Matrix Based Fuzzy Clustering
Authors: Roelof K. Brouwer, Albert Groenwold
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Clustering algorithms normally require both a method of measuring proximity between patterns and prototypes and of aggregating patterns. However sometimes only the proximities between the patterns are known. Even if patterns are available it may not be possible to find a satisfactory method of aggregating patterns for the purpose of determining prototypes. Now the distances between the membership vectors should be proportional to the distances between the feature vectors. The membership vector is just a type of feature vector. Based on this premise, this paper describes a new method for finding a fuzzy membership matrix that provides cluster membership values for all the patterns based strictly on the proximity matrix. The method involves solving a rather challenging optimization problem, since the objective function has many local minima. This makes the use of a global optimization method such as particle swarm optimization (PSO) attractive for determining the membership matrix for the clustering.
A third order numerical scheme for the two-dimensional sine-Gordon equation
Authors: A. G. Bratsos
Venue: Mathematics and Computers in Simulation (2007)

A rational approximant of third order, which is applied to a three-time level recurrence relation, is used to transform the two-dimensional sine-Gordon (SG) equation into a second-order initial-value problem. The resulting nonlinear finite-difference scheme, which is analyzed for stability, is solved by an appropriate predictor-corrector (P-C) scheme, in which the predictor is an explicit one of second order. This scheme is accelerated by using a modification (MPC) in which the already evaluated values are used for the corrector. The behavior of the proposed P-C/MPC schemes is tested numerically on the line and ring solitons known from the bibliography, regarding SG equation and conclusions for both the mentioned schemes regarding the undamped and the damped problem are derived.
Generalized Explicit Schemes for Coherence Enhancing Diffusion Filtering
Authors: Wenyuan Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper presents the generalized explicit schemes (GES) for the coherence enhancing diffusion (CED) filtering, which is one of a wide variety of nonlinear diffusion filtering. Unlike the traditional standard explicit scheme which updates the diffusion coefficients in each iteration, the generalized ones use several new updating types, including the fixed diffusion coefficients, the uniform interval update (UIU) and the optimized interval update (OIU) of diffusion coefficients. The GES significantly improve efficiency by reducing the computational amount of updating the diffusion coefficients, compared with the existing acceleration methods by enlarging the time step, such as implicit or semi-implicit schemes, or a scheme with larger mask of spatial discretization. Also the OIU may allow the GES to achieve high accuracy by using only two to four updating of the diffusion coefficients during the whole process. Experiments demonstrate the efficiency of the GES is comparable to those existing acceleration methods, meanwhile, the GES with the OIU outperform the other methods in the tradeoff between efficiency and accuracy.
Fabrication and characterization of a microelectromechanical tunable capacitor
Authors: Ching-Liang Dai, Shih-Chieh Lin, Ming-Wei Chang
Venue: Microelectronics Journal (2007)

A micromechanical tunable capacitor fabricated using the commercial 0.35@mm complementary metal oxide semiconductor (CMOS) process and the post-process has been investigated in this study. The structure of the tunable capacitor consists of a membrane, supported beams, driving and sensing electrodes. The membrane is sustained by the supported beams. The tunable capacitor requires only one wet etching post-process to release the suspended structures. The post-process has the advantages of easy execution and low cost. The tunable capacitor contains a driving part and a sensing part. The sensing part generates a change in capacitance when applying a driving voltage to the driving part. Experimental results show that the tunable capacitor has a capacitance of 1.38pF, a tuning range of 85% and a Q-factor of 40 at 100MHz.
An Entropy-Based Fuzzy Time Series Method for Forecasting Airport Passenger Throughput
Authors: Chao Zhang, Cunbao Ma, Dong Song, Wei Tian
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Airport passenger throughput forecasting (APTF) plays an important role in the intelligent air transportation systems (IATS), which has great influence on the operation, controlling and planning of civil aviation. Due to the complicacy and uncertainty of IATS, however, passenger throughput is difficult to be forecasted precisely if traditional statistical methods are applied. In order to improve the precision of APTF, a refined entropy-based fuzzy time series method is put foreword in this paper. First, according to the features of the given datum, the minimize entropy principle approach (MEPA) are adopted here to determine the length of each interval in the universe of discourse. Then, a time-invariant fuzzy relation matrix is built based on the constructed first-order fuzzy time series model, and sequentially the minimum invariant time value of which the data approaches steady state is obtain using the entropy of fuzzy set. Finally, the forecasting results are calculated based on the max-min composition operation and the principle of maximum degree of membership. To illustrate the whole forecasting process, we use the monthly data of FAA from Jan.1998 to Jun.2000 and compare results obtained with those of other approaches. It is found that the root mean square error of forecast can be improved from 39.36 for the Wu's method and 34.85 for Chen's method and 32.74 for Tsaur-Yang method to 21.98 for the proposed method, which shows that our method is doing much better.
PAS-II: An Interactive Task-Free Version of an Automatic Protocol Analysis System
Authors: D. A. Waterman, A. Newell
Venue: IEEE Transactions on Computers (1976)

PAS-II, a computer program which represents a generalized version of an automatic protocol system (PAS-I) is described. PAS-II is a task-free, interactive, modular data analysis sis system for inferring the information processes used by a human from his verbal behavior while solving a problem. The output of the program is a problem behavior graph: a description of the subject's changing knowledge state during problem solving. As an example of system operation the PAS-II analysis of a short cryptarithmetic protocol is presented.
Tasks Scheduling Based on Neural Networks in Grid
Authors: Jingbo Yuan, Shunli Ding, Cuirong Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Grid Infrastructures have been used to solve large scale problems in science, engineering, and commerce. The management and composition of resources and services for scheduling applications, however, becomes a complex undertaking. Predicting the runtime of a task, an important component of the resource management, plays an important role in the task scheduling and the resource using in computational grid. This paper presents a predicting model of task's runtime based on BP neural networks considering several factors which is the heart of any scheduling and resource allocation algorithm. The method has many advantages including small network structure, quick learning and use conveniently etc. This paper presents also a scheduling algorithm considering task's user deadline. The experiment results indicate that the method is effective and has higher accuracy.
ECO timing optimization using spare cells
Authors: Yen-Pin Chen, Jia-Wei Fang, Yao-Wen Chang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

We introduce in this paper a new problem of ECO timing optimization using spare-cell rewiring and present the first work for this problem. Spare-cell rewiring is a popular technique for incremental timing optimization and/or functional change after the placement stage. The spare-cell rewiring problem is very challenging because of its dynamic wiring cost nature for selecting a spare cell, while the existing related problems consider only static wiring cost. For the addressed problem, we present a framework of buffer insertion and gate sizing to handle it. In this framework, we present a dynamic programming algorithm considering the dynamic cost, called dynamic cost programming (DCP), for the ECO timing optimization with spare cells. Without loss of solution optimality, we further present an effective pruning method by selecting spare cells only inside an essential bounding polygon to reduce the solution space. The whole framework is integrated into a commercial design flow. Experimental results based on five industry benchmarks show that our method is very effective and efficient in fixing the timing violations of ECO paths.
Enhancing the accuracy of WLAN-based location determination systems using predicted orientation information
Authors: I-En Liao, Kuo-Fong Kao
Venue: Information Sciences: an International Journal (2008)

Indoor location determination has emerged as a significant research topic due to the wide-spread deployment of wireless local area networks (WLANs) and the demand for context-aware services inside buildings. However, prediction accuracy remains a primary issue surrounding the practicality of WLAN-based location determination systems. This study proposes a novel scheme that utilizes mobile user orientation information to improve prediction accuracy. Theoretically, if the precise orientation of a user can be identified, then the location determination system can predict that user's location with a high degree of accuracy by using the training data of this specific-orientation. In reality, a mobile user's orientation can be estimated only by comparing variations in received signal strength; and nevertheless the predicted orientation may be incorrect. Incorrect orientation information causes the accuracy of the entire system to decrease. Therefore, this study presents an accumulated orientation strength algorithm which can utilize uncertain estimated orientation information to improve prediction accuracy. Implementation of this system is based on the Bayesian model, and the experimental results indeed show the effectiveness of our proposed approach.
Finding Gender Differences in End-User Debugging: A Data Mining Approach
Authors: Valentina Grigoreanu
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

We are currently investigating what types of end user personas (or homogeneous groups in the population) exist and what works for or hinders each in end-user debugging. These personas will be determined using data mining methods such as cluster analysis to see how static (background and self-efficacy), behavioral, and success variables interact for each cluster of users. This research will help provide a better understanding of the needs of end users and the tools that are necessary for supporting both male and females in debugging tasks.
Patterns of Business Rules to Enable Agile Business Processes
Authors: Tobias Graml, Ralf Bracht, Marcus Spies
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

A problem of today's standard Business Process (BP) automation systems is that they are too rigid to cope with changing business demands, especially for long running BPs. A solution to overcome this problem is to combine BPs with Business Rules (BR). State of the art BP automa- tion systems are based on Web Service (WS) technology and use WS composition languages, for example BPEL, for ab- stract and executable BPs. On the other hand, most of to- day's implementations use BRs mostly to make calculations and to adapt simple decisions to business users without full integration into a BP automation system. We will show that BP execution and BR functionality can be integrated properly in a standard service oriented archi- tecture. This finding will be applied in a new approach of configuring BPs through using BRs. The assumption is that if one considers BRs already while modeling a BP, more ad- vanced BP aspects like decisions, data constraints and con- trol flow can be made agile and adaptive during run-time. We present multiple solutions demonstrating how BRs can be used to obtain different aspects of BP agility. Described as BP Modeling Patterns, our solutions give insight on how agile BPs can be implemented with current BP automation technology. We implemented them using IBM WebSphere Integration Developer and IBM WebSphere Process Server.
CONET: A Connection Network Model
Authors: J. E. Wirsching
Venue: IEEE Transactions on Computers (1981)

A programmed connection network model and its variants are briefly explained. The results of a parameter study are exposed showing the inherent differences in the structural variations. Some preliminary conclusions concerning effectiveness are drawn.
XSEarch: a semantic search engine for XML
Authors: Sara Cohen, Jonathan Mamou, Yaron Kanza, Yehoshua Sagiv
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

XSEarch, a semantic search engine for XML, is presented. XSEarch has a simple query language, suitable for a naive user. It returns semantically related document fragments that satisfy the user's query. Query answers are ranked using extended information-retrieval techniques and are generated in an order similar to the ranking. Advanced indexing techniques were developed to facilitate efficient implementation of XSEarch. The performance of the different techniques as well as the recall and the precision were measured experimentally. These experiments indicate that XSEarch is efficient, scalable and ranks quality results highly.
Entity matching in heterogeneous databases: A logistic regression approach
Authors: Debabrata Dey
Venue: Decision Support Systems (2008)

This paper examines a widely-encountered data heterogeneity problems-often faced in real-world decision support situations-called the entity heterogeneity problem, which arises when the same real-world entity type is represented using different identifiers in different applications. Supporting real-world decisions often requires one to identify which entity in one application is the same as another in a second application. Previous research has proposed decision models to resolve this problem. However, the implementation of those models requires either the estimation of probability parameters by manually matching a large sample of the existing data or the estimation of a distance measure based on user-specified weights. This paper proposes an alternative technique based on logistic regression for estimating the matching probabilities to be used in the matching decision model. This approach has been implemented and tested on real-world data. Comparison of the results with those from earlier approaches indicate that the proposed approach performs quite well and is certainly a viable approach in practical situations.
Experience with Multiprocessor Algorithms
Authors: J. Deminet
Venue: IEEE Transactions on Computers (1982)

This paper presents results of experiments with parallel algorithms. Several versions of four different programs, each representing a class of applications, were tested. All the experiments were performed on Cm*,l a 50-processor computer with a hierarchical structure. The results show that when the structure of an algorithm corresponds well to the structure of the computer, a close-to-linear speedup may be achieved. An attempt was made to analyze the reference patterns and interprocess cooperation and their influence on the performance of the algorithms. Several still-open questions are formulated in the paper and some further research directions are suggested.
A note on complete subdivisions in digraphs of large outdegree
Authors: Daniela Kühn, Deryk Osthus, Andrew Young
Venue: Journal of Graph Theory (2008)

Mader conjectured that for all ℓ there is an integer &delta;+(ℓ) such that every digraph of minimum outdegree at least &delta;+(ℓ)contains a subdivision of a transitive tournament of order ℓ. In this note, we observe that if the minimum outdegree of a digraph is sufficiently large compared to its order then one can even guarantee a subdivision of a large complete digraph. More precisely, let $\vec G$ be a digraph of order n whose minimum outdegree is at least d. Then $\vec G$ contains a subdivision of a complete digraph of order [d2/8n3/2]. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 57: 16, 2008 .
Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications
Venue: International Conference on Principles, Systems and Applications of IP telecommunications (2007)

While standards, open-source and commercial products now support PSTN-equivalent services for voice, video and text over IP, significant difficulties remain in deploying such IP-based telecommunication services on a large-scale, reliably and securely. Services that go beyond basic call features remain hard to develop and deploy. With this in mind, a group of researchers working in these area started IPTComm this year, with the goal to cover two of the most urgent challenges faced by providers of IP-based telecommunication services, namely how to secure their infrastructure and how to efficiently create new services. While a new event, IPTComm builds on the earlier workshops on VoIP and VoIP security. With the increased popularity of IP-based telecommunication services, it has become of utmost importance to service providers to ensure the availability of their services under all circumstances and to reduce the possibilities of fraud. In the security-related sessions at IPTComm, various threats are discussed and innovative approaches and tools for detecting attacks are presented. To extend the scope of IP-based telecommunication services and achieve new streams of revenue, service providers need efficient as well as powerful and simple-to-use tools for creating new services and integrating them into their current infrastructure. Such tools are presented in the service creation-oriented sessions in which also a number of innovative approaches for service creation and specification are discussed. Further, intelligent deployment service architectures such as peer-to-peer-based architectures or presence-based conferencing system are provided as well. With these topics, IPTComm is covering a gap that concerns service providers and that has yet to be addressed by the typical VoIP standardization bodies. With its demonstrations track, industry panel and keynote speeches by two distinguished veterans of the IP-based telecommunication industry, Jeff Pulver and Jonathan Rosenberg, IPTComm is also highlighting the important aspect of translating research into deployments.
Health aspects of wireless communication
Authors: James C. Lin
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1999)

Although our knowledge regarding the health effects of RF radiation has increased considerably, it has become a focus of attention because of the accelerated use of RF radiation for wireless communication over the past few years. This article gives a brief summary of the biological effects and health aspects of RF radiation from mobile and personal communication devices. In future articles we will deal with some of the issues raised here, such as DNA and gene expression, cancer induction and promotion, impact of modulation schemes, human studies, as well as new developments in guidelines for safety protection.