ppxscal/embedding_network huggingface dataset:
Enterprise integration of product development data: systems science in action
Authors: Scott M. Staley, John N. Warfield
Venue: Enterprise Information Systems (2007)

The work program of complexity (WPOC), stemming from systems science, was applied by a large cross-functional team of Ford engineers and system developers in the mid-1990s as an enabler to create an enterprise-wide information system known as the C3P system. This brief descriptor refers to a CAD/CAE/CAM/PIMS system, applied to design, engineer, and manufacture automobiles; and further to provide product information across and beyond the entire enterprise, extending into the supplier and customer base. The design foundation of the C3P system retains its utility today. The only system changes have arisen from technological upgrades which are independent of the original design strategy.
Retrieval of surface temperature from the MSG-SEVIRI observations: Part I. Methodology
Authors: D. Sun, R. T. Pinker
Venue: International Journal of Remote Sensing (2007)

The land surface temperature diurnal (LSTD) cycle is an important climate parameter because of its control of the upward terrestrial radiation and energy exchange between the earth surface and the atmosphere. It is highly variable in time and space and polar orbiting satellites are not able to capture this variability. Observations from the Spinning Enhanced Visible and Infrared Imager (SEVIRI) on the METEOSAT Second Generation (MSG) satellite are available at 15-min intervals at a resolution of 3 km in four relevant channels. Presented here is a newly developed four-channel surface temperature (ST) algorithm based on the characteristics of the SEVIRI three-window thermal channels (8.7, 10.8, 12.0 µm) and one middle-infrared (MIR) channel (3.9 µm) and radiative transfer model simulations. The proposed algorithm is compared with various split-window type algorithms and shows improvements in the determination of ST.
Long paths through four vertices in a 2-connected graph
Authors: Mark V. Barovich
Venue: Journal of Graph Theory (2000)

Let G be a 2-connected graph, let u and v be distinct vertices in V(G), and let X be a set of at most four vertices lying on a common (u, v)-path in G. If deg(x) &ge; d for all x &epsilon; V(G) \ {u, v}, then there is a (u, v)-path P in G with X &sbquo; V(P) and |E(P)| &ge; d. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 5565, 2000
A Cloaking Algorithm Based on Spatial Networks for Location Privacy
Authors: Po-Yi Li, Wen-Chih Peng, Tsung-Wei Wang, Wei-Shinn Ku, Jianliang Xu, J. A. Hamilton Jr.
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Most of research efforts have elaborated on k-anonymity for location privacy. The general architecture for implementing k-anonymity is that there is one trusted server (referred to as location anonymizer) responsible for cloaking at least k users' locations for protecting location privacy. A location anonymizer will generate cloaked regions in which there are at least k users for query processing. Prior works only explore grid shape cloaked regions. However, grid shape cloaked regions result in a considerable amount of query results, thereby increasing the overhead of filtering unwanted query results. In this paper, we propose a cloaking algorithm in which cloaked regions are generated according to the features of spatial networks. By exploring the features of spatial networks, the cloaked regions are very efficient for reducing query results and improving cache utilization of mobile devices. Furthermore, an index structure for spatial networks is built and in light of the proposed index structure, we develop a Spatial-Temporal Connective Cloaking algorithm (abbreviated as STCC). A simulator is implemented and extensive experiments are conducted. Experimental results show that our proposed algorithm outperforms prior cloaking algorithms in terms of the candidate query results and the cache utilization.
Friendship discrepancy and time spent on the internet
Authors: Hsieh-Hua Yang, Hung-Jen Yang
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

A questionnaire was designed to measure the university students' friendship network and the time of Internet use. Name generation was used to identify the friendship network. The result showed that the higher the discrepancy between nomination and reciprocal dyads, the longer the time spent using the Internet.
Atrial Activity Detection through a Sparse Decomposition Technique
Authors: Simão Paredes, Teresa Rocha, Paulo de Carvalho, Jorge Henriques
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Atrial fibrillation is the most common cardiac arrhythmia, presenting significant consequences on patient health. Automatic detection of atrial fibrillation needs, ideally, the isolated study of the atrial activity registered in the electrocardiogram. Sparse decomposition techniques make possible the decomposition of a signal into their components, thus the separation between atrial and ventricular activities. However, this technique requires the a priori construction of distinct dictionaries, usually built based on atrial and ventricular activity simulation models. This work addresses the construction of the dictionaries based on real electrocardiogram signals, where P-waves, QRS-complexes and T-waves are first identified to support the creation of the dictionaries. The effectiveness of the proposed methodology is validated with real signals, obtained from MIT-BIH Arrhythmia Database.
A SWOT Analysis of m-Learning Diffusion in China and Taiwan
Authors: Wei-Mann Lee, Yung-Sheng Chang
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

With the rapid advancement of wireless and mobile technology, the scope of e-Learning has extended to that of mobile and ubiquitous learning. Despite many unique advantages in learning support and wide adoption, its diffusion in higher education was rarely explored. This study took a SWOT analysis approach and surveyed factors that support and hinder the diffusion of m-Learning in China and Taiwan areas. The result indicates that m-Learning has great opportunities as well as threats.
LIFELONG INTERACTIONSMemory impairment is a family affair
Authors: Mike Wu
Venue: interactions (2008)

As all of us know, whether we are seven or 77, each of us can have challenging needs when in good health or when we are suffering from any number of ailments. The reality of understanding users is that health issues can color our lives in ways we might never expect. In this issue's forum, Mike Wu discusses the pressing needs of adults with severe memory impairments and what can be done to support them and their families through technology. What this article reminds us is that even when we consider our older or younger users, we must also consider the people that live with them. Their care-givers, whether they be grown-children or parents, can play a critical role in the lives of family members at any age. This forum on life-long interactions celebrates not just one age of user, but all ages working together to make life a little better for all of us.---Allison Druin
MRTI-Based Optimization and Real-Time Laser Surgical Control for Cancer Treatment Using Fast Inverse Analysis Techniques
Authors: Yusheng Feng, David Fuentes, Andrea Hawkins, J. Tinsley Oden
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

For cancerous tumors in vital internal organs, minimally invasive laser surgery may be a desirable choice for cancer treatment due to its precise control and compatibility with most of the imaging modalities such as MRI (magnetic resonance imaging). However, the complexity of tumor composition and tissue response to a thermal dose demands real-time optimization and control. In the previous work, weave developed a quite general computational framework that is capable of processing MRI anatomical data, providing pretreatment surgical protocol, and controlling tissue damage based on in vivo MRTI (magnetic resonance thermal imaging) data. In this paper, we describe computational techniques that are involved in real time optimization and control for laser surgical protocols of cancer treatment.
Information and Complexity in Statistical Modeling, 1 edition
Authors: Jorma Rissanen
Venue: Information Science And Statistics (2007)

No statistical model is "true" or "false," "right" or "wrong"; the models just have varying performance, which can be assessed. The main theme in this book is to teach modeling based on the principle that the objective is to extract the information from data that can be learned with suggested classes of probability models. The intuitive and fundamental concepts of complexity, learnable information, and noise are formalized, which provides a firm information theoretic foundation for statistical modeling. Inspired by Kolmogorov's structure function in the algorithmic theory of complexity, this is accomplished by finding the shortest code length, called the stochastic complexity, with which the data can be encoded when advantage is taken of the models in a suggested class, which amounts to the MDL (Minimum Description Length) principle. The complexity, in turn, breaks up into the shortest code length for the optimal model in a set of models that can be optimally distinguished from the given data and the rest, which defines "noise" as the incompressible part in the data without useful information. Such a view of the modeling problem permits a unified treatment of any type of parameters, their number, and even their structure. Since only optimally distinguished models are worthy of testing, we get a logically sound and straightforward treatment of hypothesis testing, in which for the first time the confidence in the test result can be assessed. Although the prerequisites include only basic probability calculus and statistics, a moderate level of mathematical proficiency would be beneficial. The different and logically unassailable view of statistical modelling should provide excellent grounds for further research and suggest topics for graduate students in all fields of modern engineering, including and not restricted to signal and image processing, bioinformatics, pattern recognition, and machine learning to mention just a few.
Controllability and Universal Three-qubit Quantum Computation with Trapped Electron States
Authors: L. H. Pedersen, C. Rangan
Venue: Quantum Information Processing (2008)

We show how to control and perform universal three-qubit quantum computation with trapped electron quantum states. The three qubits are the electron spin, and the first two quantum states of the cyclotron and axial harmonic oscillators. We explicitly show how universal three-qubit gates can be performed. As an example of a quantum algorithm, we outline the implementation of the three-qubit Deutsch-Jozsa algorithm in this system.
Knowledge mechanisms in ISO/IEC 42010: keynote talk
Authors: Rich Hilliard
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

IEEE Std 1471 was the first formal standard for architectural description, in active use since 2000. In 2007, IEEE 1471 became an international standard. Now ISO and IEEE are jointly revising the standard as ISO/IEC 42010, Systems and Software Engineering - Architecture Description. This talk has two parts: the first is a discussion of the mechanisms in ISO/IEC 42010 from a knowledge-theoretic point of view: both those in the 2000 edition and an update on the proposals under consideration for the current revision. The second part is a look at the future of knowledge-based work in architectural practice and architectural standards.
A comparison between two grid scheduling philosophies: EGEE WMS and Grid Way
Authors: J. L. Vázquez-Poletti, E. Huedo, R. S. Montero, I. M. Llorente
Venue: Multiagent and Grid Systems (2007)

In order to achieve a reasonable degree of performance and reliability, Metascheduling has been revealed as a key functionality of the grid middleware. The aim of this paper is to provide a comparative analysis between two major grid scheduling philosophies: a semi-centralized approach, represented by the EGEE Workload Management System, and a fully distributed approach, represented by the Grid Way Metascheduler. The distributed approach follow a loosely-coupled philosophy for the Grid resembling the end-to-end principle, which has fostered the spectacular development and diffusion of the Internet and, in particular, Web technologies in the past decade. The comparative is both theoretical, through a functionality checklist, and experimental, through the execution of a fusion physics plasma application on the EGEE infrastructure. This paper not only includes a standard analysis with the obtained times, but also a complex analysis based on a performance model.
Application of distributed SVM architectures in classifying forest data cover types
Authors: Mira Trebar, Nigel Steele
Venue: Computers and Electronics in Agriculture (2008)

In many 'real-world' applications, a classification of large data sets, which are often also imbalanced, is difficult due to the small, but usually more interesting classes. In this study, a large data set, forest cover type classes, which is actually multi-class classification defined with seven imbalanced classes and used as a resource inventory information was analyzed and evaluated. The data set was transformed into seven new data sets and a support vector machine (SVM) was employed to solve a binary classification problem of balanced and imbalanced data sets with various sizes. In the two approaches considered, the use of distributed SVM architectures, which basically reduces the complexity of the quadratic optimization problem of very large data sets, and the use of two sampling approaches for classification of imbalanced data sets were combined and results presented. The experimental results of distributed SVM architectures show the improvement of the accuracy for larger data sets in comparison to a single SVM classifier and their ability to improve the correct classification of the minority class.
A split synchronizing mobile transaction model
Authors: Miseon Choi, Wonik Park, Young-Kuk Kim
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

We propose a new notion of hoardset fragmentablilty and SSMT(Split Synchronizing Mobile Transaction) model for ubiquitous mobile clients, which not only assures transaction atomicity in synchronization but also reduces synchronization cost and provides context-awareness in ubiquitous computing environment with uneven conditioning. It splits the synchronization process of a mobile transaction into 2 parts by exploiting the hoardset fragmentability of data objects which the mobile transaction access: preferred and deferred synchronization part. The deferred synchronization part which has no possibility of conflict uses the data-centric synchronization strategy and its synchronization is delayed. The preferred synchronization part with possibility of conflicts is synchronized early using the transaction-centric synchronization strategy. We also propose a new data hoarding and synchronization mechanism which facilitates the split synchronization of SSMT. The performance evaluation model for the SSMT is developed and its results are compared to a conventional transaction-centric synchronization model.
Proposal for Modeling the Piloting System
Authors: Sarim N. Al-Zubaidy
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Current aviation accident statistics indicates that the accident rate has become nearly constant at a level which, while being very low, is never the less unacceptable in terms of calendar frequency and it will increase with aircraft hours flown. Modeling and quantification of pilot errors is therefore a useful tool to gain a better understanding of what improvements in cockpit data presentation and activity might be necessary to achieve reductions in the world accident rate in predictable timescales. Hence, it is appropriate to investigate the piloting system using tools that have been proven to be successful in increasing the safety and reliability of the technical systems. This paper reports on work in progress that was aimed in the first instance at developing a methodology for modeling the piloting system by combining human factors with the mathematics of probability. It draws on a wide range of research and data from these domains, focusing them into systems methodologies using the Total System Intervention system that is widely demonstrated in industrial applications.
An improved management model for tracking multiple features in long image sequences
Authors: Raquel R. Pinho, João Manuel R. S. Tavares, Miguel V. Correia
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

In this paper we present a management model to deal with the problem of tracking a large number of features during long image sequences. Some usual difficulties are related to this problem: features may be temporarily occluded or might even have disappeared definitively; the computational cost involved should always be reduced to the strictly necessary. The proposed Net Present Value (NPV) model, based on the economic Theory of Capital, considers the tracking of each missing feature as an investment. Thus, using the NPV criterion, with adequate receipt and outlay functions, each occluded feature may be kept on tracking or it may be excluded of the tracking process depending on its historical behavior. This methodology may be applied to any tracking system as long as the tracking results may be evaluated in each temporal step. Experimental results, both on synthetic and real image sequences, which validate our model, will be also presented.
Interactive generation of integrated schemas
Authors: Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unified schema gives a standard representation of the data, thus offering a way to deal with the heterogeneity in the sources. In this paper, we develop a method and a design tool that provide: 1) adaptive enumeration of multiple interesting integrated schemas, and 2) easy-to-use capabilities for refining the enumerated schemas via user interaction. Our method is a departure from previous approaches to schema integration, which do not offer a systematic exploration of the possible integrated schemas. The method operates at a logical level, where we recast each source schema into a graph of concepts with Has-A relationships. We then identify matching concepts in different graphs by taking into account the correspondences between their attributes. For every pair of matching concepts, we have two choices: merge them into one integrated concept or keep them as separate concepts. We develop an algorithm that can systematically output, without duplication, all possible integrated schemas resulting from the previous choices. For each integrated schema, the algorithm also generates a mapping from the source schemas to the integrated schema that has precise information-preserving properties. Furthermore, we avoid a full enumeration, by allowing users to specify constraints on the merging process, based on the schemas produced so far. These constraints are then incorporated in the enumeration of the subsequent schemas. The result is an adaptive and interactive enumeration method that significantly reduces the space of alternative schemas, and facilitates the selection of the final integrated schema.
Sorting on a parallel pointer machine with applications to set expression evaluation
Authors: M. T. Goodrich, S. R. Kosaraju
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Optimal algorithms for sorting on parallel CREW (concurrent read, exclusive write) and EREW (exclusive read, exclusive write) versions of the pointer machine model are presented. Intuitively, these methods can be viewed as being based on the use of linked lists rather than arrays (the usual parallel data structure). It is shown how to exploit the 'locality' of the approach to solve a problem with applications to database querying and logic programming (set-expression evaluation) in O(log n) time using O(n) processors.
The Boeing 777: No Chainsaw Massacres, Please!
Authors: Niels Jørgensen
Venue: Journal of Integrated Design Process Science (2006)

Iterative life cycle models have become popular in software engineering, e.g. in agile development. In contrast, the waterfall model appears to prevail in manufacturing engineering disciplines. This includes aircraft engineering and Boeing's project for developing its most recent passenger aircraft, the 777. The paper walks through the phases of the 777's development and compares this process to iterative development. The comparison suggests two observations: Firstly, the over-all waterfall approach in the 777 project appears to be well-motivated by the physical, manufactured nature of aircraft components such as wings, in addition to safety concerns. Secondly, several iterative elements in the development of the 777 can also be identified. A major source of these is digitalization of development, in particular the use of CAD tools for a process called digital preassembly.
A numerical analysis of the Burgers-Poisson (BP) equation using variational iteration method
Authors: E. Hizel, S. Küçükarslan
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

In this paper, the numerical analysis of dispersive type wave equation (Burgers-Poisson Equation) is studied. The analyses are carried out by using both finite difference method (FDM) and variational iteration methods (VIM). The stability and consistency of the obtained finite difference equation is provided. The available exact solution and the result of these two numerical methods are compared to see the accuracy for a specified length and time interval.
Location/situation-aware architecture for mobility management over heterogeneous networks
Authors: Ernestina Cianca, Antonella Molinaro, Mauro De Sanctis, Antonio Iera, Giuseppe Araniti, Marina Ruggieri
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

The 4G converged wireless network may benefit by the capability of exploiting location/situation information for more efficient "seamless" integration of heterogeneous radio access networks. In this framework, the paper defines the architecture able to collect the location/situation information, process it and distribute it to the network nodes that will exploit it to successfully implement location/situation aware mobility management mechanisms. Since the architecture is distributed and must interact with different technologies and layers, a multi agent-based middleware has been chosen to implement some components of the proposed communication platform. Moreover, the paper presents a vertical handover decision criterion that combines location/situation information. Challenges and open issues of this new research area are discussed.