ppxscal/embedding_network huggingface dataset:
Grid Service Configuration and Lifecycle Management
Authors: J. McCabe, T. J. Harmer, P. Donachy, R. H. Perrott, C. Chambers, S. Craig, R. Lewis, B. Mallon, L. Sluman
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

This paper presents a Domain Configuration grid service which provides a service configuration and lifecycle management mechanism for a Grid infrastructure employing a service oriented architecture (SOA). A SOA Grid infrastructure is typically composed of numerous domains, which in turn are typically composed of numerous services. A Grid usually exists to achieve a set of pre-defined goals; therefore services must interoperate possibly across independent domains to meet the objective(s). This paper details a discussion of the reasons why service configuration and lifecycle management is required in a loosely coupled distributed system, in particular a Grid SOA system named Gridcast. In order to avail of the benefits offered by a loosely coupled system it is important to maintain an efficient Grid, this paper presents a number of service configuration and lifecycle management strategies which aim to achieve that goal.
New Models for the Clustering of Large Databases through a Hierarchical Paradigm
Authors: Irene Luque Ruiz, Gonzalo Cerruela Garcia, Manuel Urbano Cuadrado, Miguel Angel Gomez-Nieto
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The recovery of information from large databases based on similarity approach supposes a high computational cost when the process is carried out comparing each one of the records with the search pattern. If the database records store some data structure representing the information of the problem domain by means of a graph it is possible to classify these records using a hierarchical model, which considers the structural basic elements of the graphs and diminishes the computational cost of the recovery process considerably. In this paper we propose a classification model based on structural elements (cycles and chains) for large and medium databases.
Performance improvement of n-MOSFETs with constituent gradient HfO2/SiO2 interface
Authors: K. Iwamoto, A. Ogawa, T. Nabatame, H. Satake, A. Toriumi
Venue: Microelectronic Engineering (2005)

We investigated an influence of the constituent gradient interfacial layer (CG-IL) between HfO2 and SiO2 on the electrical characteristics of high-k MOSFETs. The CG-IL structure was successfully grown by the newly developed layer-by-layer deposition and annealing (LL-D&A) technique. The dielectric constant of the CG-IL was higher than that of SiO2-IL, because Hf atoms were diffused into the underlying SiO2 layer and Si-O-Hf bonds were formed. Furthermore, the CG-IL structure can significantly reduce the scattering center which is considered to exist at the HfO2/SiO2 interface, and thus improve the effective electron mobility. We consider that the CG-IL structure is useful to improve the electrical characteristics of n-MOSFETs with HfO2 films.
A Lagrangian particle level set method
Authors: Simone E. Hieber, Petros Koumoutsakos
Venue: Journal of Computational Physics (2005)

We present a novel particle level set method for capturing interfaces. The level set equation is solved in a Lagrangian frame using particles that carry the level set information. A key aspect of the method involves a consistent remeshing procedure for the regularization of the particle locations when the particle map gets distorted by the advection field. The Lagrangian description of the level set method is inherently adaptive and exact in the case of solid body motions. The efficiency and accuracy of the method is demonstrated in several benchmark problems in two and three dimensions involving pure advection and curvature induced motion of the interface. The simplicity of the particle description is shown to be well suited for real time simulations of surfaces involving cutting and reconnection as in virtual surgery environments.
Using semiclassical trajectories for the time-evolution of interacting quantum-mechanical systems
Authors: D. E. Dauger, V. K. Decyk, J. M. Dawson
Venue: Journal of Computational Physics (2005)

We have developed a method that recasts the time-propagation of dynamic, mutually interacting quantum-mechanical wavefunctions principally as the time-evolution of many classical particles. Our approach utilizes an approximation of Feynman path integrals, known as the semiclassical method, to reduce the path integral to only the ''classical'' paths connecting the wavefunction at one time step to the next. In exchange for simplifying the path sampling, each classical path's contribution gains a determinant term dependent on the path and its environment. Like virtual particles in quantum field theory, ''virtual classical particles'' are said to follow these classical paths. Pushing these virtual classical particles provides the necessary data to evolve quantum wavefunctions in time. Particle-based techniques implemented on parallel computers can then be used to propagate quantum systems using this alternative method.
News Briefs
Authors: Linda Dailey Paulson
Venue: Computer (2005)

Solar- and Bicycle-Powered Telecom System Build for Developing WorldA system built with off-the-shelf, low-power hardware offers an opportunity to bring affordable technology to areas in the developing world that do not have electricity or telecommunications services.New Monitor Shows Two Images at the Same TimeA new monitor that uses parallax-barrier technology to show two distinct images at the same time could be used in computers, TVs, and electronic billboards.High-Capacity Flash Could Replace Small Hard DrivesA flash memory chip that will double storage capacity in mobile devices could potentially offer enough capacity to replace mini-hard drives in smaller laptops.
DRM interoperability analysis from the perspective of a layered framework
Authors: Gregory L. Heileman, Pramod A. Jamkhedkar
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

Interoperability is currently seen as one of the most significant problems facing the digital rights management (DRM) industry. In this paper we consider the problem of interoperability among DRM systems from the perspective of a layered architectural framework. The advantage of looking at the problem from this point of view is that the layered framework provides a certain amount of structure that is very helpful in guiding those working on DRM interoperability issues. Specifically, the layered framework we describe provides a useful design abstraction along architectural lines. One of the advantages of this perspective is that it allows us to consider the level within computing/communication architectures at which certain functionality should be provided, and then to address how the functionality between layers should interact in order to provide specific DRM capabilities. The communications that occur between layers, both within a single system and between two communicating systems, are the places where protocols can be defined and possibly standardized. Thus, they provide focal points for studying and addressing interoperability in DRM systems.
A Nitpicker's guide to a minimal-complexity secure GUI
Authors: Norman Feske, Christian Helmuth
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Malware such as Trojan Horses and spyware remain to be persistent security threats that exploit the overly complex graphical user interfaces of today's commodity operating systems. In this paper, we present the design and implementation of Nitpicker an extremely minimized secure graphical user interface that addresses these problems while retaining compatibility to legacy operating systems. We describe our approach of kernelizing the window server and present the deployed security mechanisms and protocols. Our implementation comprises only 1,500 lines of code while supporting commodity software such as X11 applications alongside protected graphical security applications. We discuss key techniques such as client-side window handling, a new floating-labels mechanism, dragand- drop, and denial-of-service-preventing resource management. Furthermore, we present an application scenario to evaluate the feasibility, performance, and usability of our approach.
Emotion-based music recommendation by association discovery from film music
Authors: Fang-Fei Kuo, Meng-Fen Chiang, Man-Kwan Shan, Suh-Yin Lee
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

With the growth of digital music, the development of music recommendation is helpful for users. The existing recommendation approaches are based on the users' preference on music. However, sometimes, recommending music according to the emotion is needed. In this paper, we propose a novel model for emotion-based music recommendation, which is based on the association discovery from film music. We investigated the music feature extraction and modified the affinity graph for association discovery between emotions and music features. Experimental result shows that the proposed approach achieves 85% accuracy in average.
Hardware Acceleration of Deadlock Avoidance and Detection in Real-Time Operating Systems
Authors: P. Samson, P. Sinha
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In a multitasking environment, resource management policies, being devised and utilized to ensure proper inter-process resource sharing, incur significant operational overhead due to their inherent complexity and often lead to performance penalties, which could be detrimental to the timing responses of critical systems. In this paper, we propose and demonstrate an approach to alleviate degraded system¿s timing performance by associating the underlying RTOS with a hardware accelerator to speed up resource management functions, more particularly those dealing with deadlock avoidance. Experimentally, the proposed solution for deadlock avoidance surpasses its software implementation with an acceleration gain of up to 98 %.
Enriching and designing metaschemas for the umls semantic network
Authors: Yehoshua Perl
Venue:  (2004)

The disparate terminologies used by various biomedical applications or professionals make the communication between them more difficult. The Unified Medical Language System (UMLS) of the National Library of Medicine (NLM) is an attempt to integrate different medical terminologies into a unified representation framework to improve decision making and the quality of patient care as well as research in the health-care field. Metathesaurus (META) and Semantic Network (SN) are two main components of the UMLS system, where the SN provides a high-level abstract of the concepts in the META. This dissertation addresses three problems of the SN. First, the SN's two-tree structure is restrictive because it does not allow a semantic type to be a specialization of several other semantic types. This restriction leads to the omission of some subsumption knowledge in the SN. Secondly, the SN is large and complex for comprehension purposes and it does not come with a pictorial representation for users. As a partial solution for this problem, several metaschemas were previously built as higher-level abstractions for the SN to help users' orientation. Third, there is no efficient method to evaluate each metaschema. There is no technique to obtain a consolidated metaschema acceptable for a majority of the UMLS's users. In this dissertation work the author attacked the described problems by using the following approaches. (1) The SN was expanded into the Enriched Semantic Network (ESN), a multiple subsumption structure with a directed acyclic graph (DAG) IS-A hierarchy, allowing a semantic type to have multiple parents. New viable IS-A links were added as warranted. Two methodologies were presented to identify and add new viable IS-A links. The ESN serves as an extended high-level abstract of the META. (2) The ESN's semantic relationship distribution and concept configuration were studied. Rules were defined to derive the ESN's semantic relationship distribution from the current SN's semantic relationship distribution. A mapping function was defined to map the SN's concept configuration to the ESN's concept configuration, avoiding redundant classifications in the ESN's concept configuration. (3) Several new metaschmas for the SN and the ESN were built and evaluated based on several different partitioning techniques. Each of these metaschema can serve as a higher-level abstraction of the SN (or the ESN).
Innovative use of Mobile Learning for Occupational Stress: Evaluation of Non Functional Requirements and Architectures
Authors: Gianna Avellis, Anthony Finkelstein
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

We investigate an innovative use of mobile learning for Long Term Absents (LTAs) from work for Occupational Stress. There is a need to represent the educational needs of LTAs, and to reason on them for choosing the most suitable Mobile Learning Contents (MLC) and mobile learning architectures. The main aim of this paper is to tackle the problem of evaluating MLC Non Functional Requirements (NFRs) by developing a scheme for annotating NFRs to architectures.
Movement time for motion-impaired users assisted by force-feedback: effects of movement amplitude, target width, and gravity well width
Authors: Faustina Hwang, Simeon Keates, Patrick Langdon, John Clarkson
Venue: Universal Access in the Information Society (2005)

This paper presents a study investigating how the performance of motion-impaired computer users in &#x201c;point and click&#x201d; tasks varies with target distance (A), target width (W), and force-feedback gravity well width (GWW). Six motion-impaired users performed &#x201c;point and click&#x201d; tasks across a range of values for A, W, and GWW. Times were observed to increase with A, and to decrease with W. Times also improved with GWW, and, with the addition of a gravity well, a greater improvement was observed for smaller targets than for bigger ones. It was found that Fitts&#x2019; Law gave a good description of behaviour for each value of GWW, and that gravity wells reduced the effect of task difficulty on performance. A model based on Fitts&#x2019; Law is proposed, which incorporates the effect of GWW on movement time. The model accounts for 88.8% of the variance in the observed data.
A Model-Based Development Method for SmartOSEK OS
Authors: Zhigang Gao, Zhaohui Wu, Ruizhi Ye, Long Yue
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

With their increasingly wide application in large systems, embedded systems become more and more complicated. However, up to now there has been no mature methodology in embedded software design. In order to resolve this problem, much research has been performed. Designing embedded software based on models has become one of the research focuses. At present, the research on the design of model-based embedded software mostly focuses on theoretical models and simulations, rarely involving in model transformations and implementations of systems. In this paper, a new model-based design method of embedded software is presented for an OSEK compatible operating system-SmartOSEK OS. It emphasizes the transformation from problem domain to implementation domain. First, we use Ptolemy II to model and simulate in problem domain. Then, the transformation from problem domain to implementation domain is carried out. We have developed a suit of tools to support the whole developing process from modeling to code generation. It has been proved that higher productivity and quality can be achieved by using this method.
Towards Optimal Image Stitching for Virtual Microscopy
Authors: Ben Appleton, Andrew P. Bradley, Michael Wildermoth
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

In this paper we present an image stitching method based on dynamic programming and describe its application to automated slide acquisition for Virtual Microscopy (VM). Given a large number of fields of view (FOVs) acquired from a single microscope slide, we composite these images into a single large 'virtual slide' image. The location of each FOV is determined using a new algorithm based on dynamic programming. We compare the performance of the proposed algorithm to an existing greedy algorithm. In a visual trial it is shown that the new algorithm provides a significant improvement in perceived image quality at image boundaries compared to the existing algorithm.
Cooperative-Diversity Slotted ALOHA
Authors: Wing-Hin Wong, John M. Shea, Tan F. Wong
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

We propose a cooperative-diversity technique for ad hoc networks based on the decode-and-forward relaying strategy. We develop a MAC protocol based on slotted ALOHA that allows neighbors of a transmitter to act as relays and forward a packet toward its final destination when the transmission to the intended recipient fails. The proposed technique provides additional robustness against fading, packet collisions and radio mobility. Network simulations con- firm that under heavy traffic conditions, in which every radio always has packets to send, the proposed cooperativediversity slotted-ALOHA protocol can provide a higher onehop and end-to-end throughput than the standard slotted- ALOHA protocol can. A similar advantage in end-to-end delay can be obtained when the traffic is light. As a result, the proposed cooperative-diversity ALOHA protocol can be used to improve these measures of quality of service (QoS) in ad hoc wireless networks.
A New Hybrid Fault Detection Technique for Systems-on-a-Chip
Authors: Paolo Bernardi, Leticia Maria Veiras Bolzani, Maurizio Rebaudengo, Matteo Sonza Reorda, Fabian Luis Vargas, Massimo Violante
Venue: IEEE Transactions on Computers (2006)

Hardening SoCs against transient faults requires new techniques able to combine high fault detection capabilities with the usual requirements of SoC design flow, e.g., reduced design-time, low area overhead, and reduced (or null) accessibility to source core descriptions. This paper proposes a new hybrid approach which combines hardening software transformations with the introduction of an Infrastructure IP with reduced memory and performance overheads. The proposed approach targets faults affecting the memory elements storing both the code and the data, independently of their location (inside or outside the processor). Extensive experimental results, including comparisons with previous approaches, are reported, which allow practically evaluating the characteristics of the method in terms of fault detection capabilities and area, memory, and performance overheads.
Data distribution platform for multimedia mobile applications
Authors: Marcel Cremene, Michel Riveill, Iulian Benta
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

The new mobile access solutions are more valuable especially due to multimedia applications available anytime and anywhere. A problem is that the user needs to manage not only his own data but also the terminal limited memory and the available networks in conditions of a high terminal and network diversity, offering different quality for different prices. In this paper, we propose a platform that helps the user to optimize data management by data balancing between a mobile client and a fixed server. The goals are: increase the data availability, reduce the transport costs and duration and avoid filling the entire terminal memory. The decisions are made by a neural-fuzzy expert system.
Why skewing works: learning difficult Boolean functions with greedy tree learners
Authors: Bernard Rosell, Lisa Hellerstein, Soumya Ray, David Page
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the presence of irrelevant variables. We prove tha, in an idealized setting, for any function and choice of skew parameters, skewing finds relevant variables with probability 1. We present experiments exploring how different parameter choices affect the success of skewing in empirical settings. Finally, we analyze a variant of skewing called Sequential Skewing.
Two-dimensional time dependent Riemann solvers for neutron transport
Authors: Thomas A. Brunner, James Paul Holloway
Venue: Journal of Computational Physics (2005)

A two-dimensional Riemann solver is developed for the spherical harmonics approximation to the time dependent neutron transport equation. The eigenstructure of the resulting equations is explored, giving insight into both the spherical harmonics approximation and the Riemann solver. The classic Roe-type Riemann solver used here was developed for one-dimensional problems, but can be used in multidimensional problems by treating each face of a two-dimensional computation cell in a locally one-dimensional way. Several test problems are used to explore the capabilities of both the Riemann solver and the spherical harmonics approximation. The numerical solution for a simple line source problem is compared to the analytic solution to both the P"1 equation and the full transport solution. A lattice problem is used to test the method on a more challenging problem.
Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems
Authors: Traian Pop, Paul Pop, Petru Eles, Zebo Peng
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

We present an approach to the analysis and optimization of heterogeneous distributed embedded systems for hard real-time applications. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource, they are organized in a hierarchy. In this paper; we address design problems that are characteristic to such hierarchically scheduled systems: assignment of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We present algorithms for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilization of the system.
When Plans do not Work Out: How Plans are Used in Software Development Projects
Authors: Kari Rönkkö, Yvonne Dittrich, Dave Randall
Venue: Computer Supported Cooperative Work (2005)

Based on empirical material from the area of software engineering, this article discusses the issue of plans and planning as an integral part of and prerequisite for software development work. It relates observed practices to literature produced by the Computer Supported Cooperative Work community. Empirical studies of software development practice seldom address re-planning. By analyzing the empirical material from one project we are able to show how certain kinds of co-ordination problems arise and how they may be dealt with. The empirical research does not focus primarily on the character of plans; instead, it raises the question `what means are necessary and should be provided in order to cope with situations when plans do not work out? In relation to plans, especial emphasis is on "due process", i.e. how the project plan and the company wide project model are maintained to enable the identification and articulation of deviations from it. On the basis of our empirical analysis we propose to support the articulation and coordination work necessary in situations where plans do not adequately work out.