10228448
A Z Approach in Validating ORA-SS Data Models
The rapid growth of the World Wide Web has resulted in more data being accessed over the Internet. In turn there is an increase in the use of semistructured data, which plays a crucial role in many web applications particularly with the introduction of XML and its related technologies. This increase in use makes the design of good semistructured data structures essential. The Object Relationship Attribute model for Semistructured data (ORA-SS) is a graphical notation for designing and representing semistructured data. In this paper, we demonstrate an approach to formally validate the ORA-SS data models in order to enhance the correctness of semistructured data design. A mathematical semantics for the ORA-SS notation is defined using the Z formal language, and further validation processes are carried out to check the correctness of the semistructured data models at both the schema and instance levels.
9978689
A PVS Approach to Verifying ORA-SS Data Models
The rapid growth of the World Wide Web has resulted in a dramatic increase in semistructured data usage. This creates a growing need for ensuring consistency of the data especially when applications or databases change the schema of semistructured data. In this paper, we demonstrate an approach to formally define and verify the ORA-SS data model for semistructured data design. A mathematical semantics for the ORA-SS notation is defined using the PVS formal language. With this semantics, it is possible to perform automated verification via the PVS theorem prover to identify the inconsistencies in designing ORA-SS data models. The verification is based on criteria for semistructured data ve rification at both schema and data instance levels.
18035365
A Web Service Approach to Universal Accessibility in Collaboration Services
The enormous growth in wireless communications and miniaturized handheld devices in the last few years, have given rise to a vast range of new services, for heterogeneous user environments. In this paper, we investigate the nature of designing distributed services that accommodate pervasive devices. We introduce Universal Accessible Web service architecture, CAROUSEL Web service. We present our collaborative Web services model linked with an event brokering service, NaradaBrokering. We discuss how a rich synchronous and asynchronous collaboration environment can support virtual communications while being built on top of a Web service infrastructure, based on industry standard portal technologies such as XML, Apache’s Jetspeed, and WSDL. The linkage of the event brokering system with a Web service based architecture is one of the critical design issues in message-based collaborative application. We also describe the approach to universal access mechanisms in our collaborative Web service model. Also included is a discussion of the prototype collaborative SVG (Scalable Vector Graphics) browser that we developed as a Web service.
852427
Multisensor raster and vector data fusion based on uncertainty modeling
We propose a new methodology for fusing temporally changing multisensor raster and vector data by developing a spatially and temporally varying uncertainty model of acquired and transformed multisensor measurements. The proposed uncertainty model includes errors due to (1) each sensor by itself, e.g., sensor noise; (2) transformations of measured values to obtain comparable physical entities for data fusion and/or to calibrate sensor measurements; (3) vector data spatial interpolation that is needed to match different spatial resolutions of multisensor data; and (4) temporal interpolation that has to take place if multisensor acquisitions are not accurately synchronized. The proposed methodology was tested using simulated data with varying (a) amount of sensor noise, (b) spatial offset of point sensors generating vector data, and (c) model complexity of the underlying physical phenomenon. We demonstrated the multisensor fusion approach with a data set from a structural health monitoring application domain.
819318
Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes
Mesh chartification is an important tool for processing meshes in various applications. In this paper, we present a novel feature sensitive mesh chartification technique that can handle huge meshes with limited main memory. Our technique adapts the mesh chartification approach using Lloyd-Max quantization to out-of-core processing. While the previous approach updates chartification globally at each iteration of Lloyd-Max quantization, we propose a local update algorithm where only a part of the chartification is processed at a time. By repeating the local updates, we can obtain a chartification of a huge mesh that cannot fit into the main memory. We verify the accuracy of the serialized local updates by comparing the results with the global update approach. We demonstrate that our technique can successfully process huge meshes for applications, such as mesh compression, shape approximation, and remeshing.
8387395
A reconfigurable crossbar switch with adaptive bandwidth control for networks-on-chip
We propose a new crossbar switch structure with adaptive bandwidth control. In a complex SoC design, the proposed crossbar switch efficiently incorporates various IPs with different bandwidth requirements. Simulation under various traffic scenarios shows that the throughput of the proposed crossbar switch is as high as that of a conventional switch operating at twice the speed. The proposed crossbar switch shows maximum 27% improvement in throughput and maximum 41% improvement in latency compared to the conventional one. The proposed crossbar switch is implemented using Verilog HDL, synthesized with an 0.18 /spl mu/m process library, and verified on FPGAs. The area and power overhead of the proposed crossbar switch is 21% and 15%, respectively, when compared to the conventional crossbar switch.
6805642
Uniformly cordial graphs
Let G be a graph with vertex set V(G) and edge set E(G). A labeling f:V(G)->{0,1} induces an edge labeling f^*:E(G)->{0,1}, defined by f^*(xy)=|f(x)-f(y)| for each edge [email protected]?E(G). For [email protected]?{0,1}, let n"i(f)=|{[email protected]?V(G):f(v)=i}| and m"i(f)=|{[email protected]?E(G):f^*(e)=i}|. Let c(f)=|m"0(f)-m"1(f)|. A labeling f of a graph G is called friendly if |n"0(f)-n"1(f)|= =2 is uniformly cordial if and only if n=3 and G=K"3, or n is even and G=K"1","n"-"1.