ppxscal/embedding_network huggingface dataset:
Self-Service Collaborative Applications: Automated Generation and Deployment of Applications Using a Visual Interface and Specification Tool
Authors: Scott S. F. Tse, Gene Moore, Sangeeta Narang
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

In an ideal world, every content-rich, information-based decision facing a distributed team is supported by a custom collaborative environment developed specifically for that team to address that problem at that stage of their collaboration process. In today's world, this is simply not practical given the wide range of collaborative scenarios, and the dependency on trained software developers and the traditional development process to implement and realize such a custom interactive environment. In a previous paper, the authors advanced the idea that a self-service collaborative application development platform would make the ideal scenario realizable. That is, a system can be developed which enables an average user to create and deploy, in a relatively short period of time, a collaborative application of light-to-medium complexity without the need for programming skills or a programming team. The authors introduced a framework within which such a system can be achieved. This paper presents further refinements of the framework, and shows details of the current implementation of a self-service development platform. Additionally, this paper highlights a visual interface and specification tool, which empowers an average user to design a collaborative application without coding or any knowledge of programming. This tool works in conjunction with a server system that facilitates the automated generation and deployment of collaborative web applications. Finally, this paper discusses several case examples that indicate the effectiveness of the current platform.
Content-Based Dynamic 3D Mosaics
Authors: Zhigang Zhu, Hao Tang
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We propose a content-based 3D mosaic (CB3M) representation for long video sequences of 3D and dynamic scenes captured by a camera on a mobile platform. After a set of parallel-perspective (pushbroom) mosaics with varying viewing directions is generated, a multi-view, segmentation-based stereo matching algorithm is applied to extract parametric representations of the color, structure and motion of the dynamic and/or 3D objects in urban scenes. We use the fact that all the static objects obey the epipolar geometry of pushbroom stereo, whereas an independent moving object either violates the epipolar geometry if the motion is not in the direction of sensor motion or exhibits unusual 3D structures. The CB3M is a highly compressed visual representation for a very long video sequence of a dynamic 3D scene. More importantly, the CB3M representation has object contents of both 3D and motion. Experimental results are given for the CB3M construction for both simulated and real video sequences.
Implementation of the people capability maturity model with technical support personnel in volusia county school district (florida)
Authors: Gertrude A. Abramson
Venue:  (2006)

The problem addressed was that many school districts do not have the operational funding to provide sufficient technology support. Whereas large companies strive to have at least one professional technology support person for every 50 computers, few school districts can afford to fund this ratio. Further, technology support is frequently ignored in the school district if it comes at the expense of hiring teachers to provide educational opportunities or reducing class sizes for students. The People Capability Maturity Model (P-CMM) is a tool for managing and developing an organization's workforce practices. A 6-month application of the P-CMM was applied to a Support Services Department in Volusia County School District in Florida. The goal was to explore the effectiveness of the application of the P-CMM in improving the use of best practices in a limited technology support personnel department. The results describe a single-case study of the application of the P-CMM model to a public school district technology support department. The IDEAL (Initiating, Diagnosing, Establishing, Acting, and Learning) process was used in applying the P-CMM. During the initiating phase, participation was gained and an overview of the P-CMM was provided. At the diagnosing phase, a questionnaire and a gap analysis found that the organization was assessed at Level 2 of the P-CMM. The area of Training and Development was identified as particularly weak in the organization, and during the establishing phase it was identified as the focus for the application. Competency Analysis was administered to determine what training was required. At the acting phase, an action plan was developed. During the learning phase, the questionnaire and the gap analysis were repeated to assess changes in workforce competencies. Although the organization did not reach Level 3 of the P-CMM, competencies were identified and improvements were made in Training and Development. This case study may be used as a model for replication in other school districts or organizations that need to improve the use of limited technology support in their organization.
Survivable IP network design with OSPF routing
Authors: L. S. Buriol, M. G. C. Resende, M. Thorup
Venue: Networks (2007)

Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path-based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc weights assigned by the network operator. Each router computes shortest paths and creates destination tables used for routing flow on the shortest paths. If a router has multiple outgoing links on shortest paths to a given destination, it splits traffic evenly over these links. It is also the role of the routing protocol to specify how the network should react to changes in the network topology, such as arc or router failures. In such situations, IP traffic is rerouted through the shortest paths not traversing the affected part of the network. This article addresses the issue of assigning OSPF weights and multiplicities to each arc, aiming to design efficient OSPF-routed networks with minimum total weighted multiplicity (multiplicity multiplied by the arc length) needed to route the required demand and handle any single arc or router failure. The multiplicities are limited to a discrete set of values, and we assume that the topology is given. We propose an evolutionary algorithm for this problem, and present results applying it to several real-world problem instances. &copy; 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 51&ndash;64 2007
Performance Analysis and Evaluation of Bluetooth Networks in Wireless Channel Environment
Authors: Jae Sung Roh
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Progress in wireless technology has fostered the widespread use of computing and communication devices for commercial usage. The success of consumer products like PCs, laptops, PDA, mobile phones, and their peripherals has been based on continuous cost and size reduction. The objective of this paper is to evaluate the impacts of impulsive noise, cochannel interference due to other piconet, Nakagami fading on the bit error rate (BER), and throughput performance in the Bluetooth scatternet. Simulation results illustrate the significant difference in performance between synchronous and asynchronous Bluetooth networks. The paper also provides the insights on how to design Bluetooth scatternet for minimal error rate and maximum throughput performance.
Multi-column substring matching for database schema translation
Authors: Robert H. Warren, Frank Wm. Tompa
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

We describe a method for discovering complex schema translations involving substrings from multiple database columns. The method does not require a training set of instances linked across databases and it is capable of dealing with both fixed-and variable-length field columns. We propose an iterative algorithm that deduces the correct sequence of concatenations of column substrings in order to translate from one database to another. We introduce the algorithm along with examples on common database data values and examine its performance on real-world and synthetic datasets.
Assessing and Assuring Trust in E-Commerce Systems
Authors: Zhongwei Zhang, Zhen Wang
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

On-line trading or Internet Commerce restoring to E-Commerce systems are gradually replacing the traditional commerce activities. Internet users must have reasonable faith on the underlying systems before comfortably using it, To convince users to confidently enjoy the benefits that Internet and E-commerce systems can bring, an E-commerce system needs to be trustful and convincing to the users. In the paper, we proposed a computational model on which the E-commerce system can be developed, and the trust level will be introduced and assessed based on users attitudes, opinions and motivations, and provide some insight for the customers of Internet commerce. The model has two features: to assess the trust level of existing E-commerce systems, and to recommend the E-Retailers how to improve the trust level. Based on the model, a prototype system of assessing trust level of E-commerce system has been designed. Online based e-EI system has demonstrated the computational model is feasible and the implemented system is efficient and reliable. It is of significance in recommending the E-retailers to improve the trust level of their E-commerce systems.
Integrating Timed Automata into Tabu Algorithm for HW-SW Partitioning
Authors: Geguang Pu, Zhang Chong, Zongyan Qiu, Jifeng He, Wang Yi
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

Hardware/software (HW-SW) partitioning is a key problem in codesign of embedded systems, studied extensively in the past. This paper describes a new approach to hardware/software partitioning for synchronous model. We formalize the partitioning problem using timed automata, which captures the key elements of the partitioning. Then the tabu algorithm is applied to timed automata model to search for the solution efficiently. An industrial experiment is conducted to show our approach can handle large applications with hundreds of nodes in task graph effectively.
Suppressing model overfitting in mining concept-drifting data streams
Authors: Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jeffrey Xu Yu
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distribution. This poses a serious challenge. On the one hand, relying on historical data may increase the chances of learning obsolete models. On the other hand, learning only from the latest data may lead to biased classifiers, as the latest data is often an unrepresentative sample of the current class distribution. The problem is particularly acute in classifying rare events, when, for example, instances of the rare class do not even show up in the most recent training data. In this paper, we use a stochastic model to describe the concept shifting patterns and formulate this problem as an optimization one: from the historical and the current training data that we have observed, find the most-likely current distribution, and learn a classifier based on the most-likely distribution. We derive an analytic solution and approximate this solution with an efficient algorithm, which calibrates the influence of historical data carefully to create an accurate classifier. We evaluate our algorithm with both synthetic and real-world datasets. Our results show that our algorithm produces accurate and efficient classification.
Secrecy by Typing and File-Access Control
Authors: Avik Chaudhuri, Martin Abadi
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

Secrecy properties can be guaranteed through a combination of static and dynamic checks. The static checks may include the application of special type systems with notions of secrecy. The dynamic checks can be of many different kinds; in practice, the most important are access-control checks, often ones based on ACLs (access-control lists). In this paper, we explore the interplay of static and dynamic checks in the setting of a file system. For this purpose, we study a pi calculus with file-system constructs. The calculus supports both access-control checks and a form of static scoping that limits the knowledge of terms--including file names and contents--to groups of clients. We design a system with secrecy types for the calculus; using this system, we can prove secrecy properties by static typing of programs in the presence of file-system access-control checks.
Using autonomous modular material handling equipment for manufacturing flexibility
Authors: Björn Johansson, Edward J. Williams, Tord Alenljung
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper describes a modular autonomous material handling equipment solution for flexible automation. Discrete Event Simulation is in this case used as a tool for shortening time spent in many different phases of manufacturing systems lifecycle. The paper presents the concept of autonomous modular material handling equipment, and how simulation is used as a support tool and lead time reducer in each lifecycle phase. Furthermore, we describe the knowledge levels needed for using the simulation support and conclude with examples of how this methodology are reducing lead times within a company.
Coupling Latency Time to the Throughput Performance Analysis on Wireless CAN Networks
Authors: Sofiene DRIDI, Bechir GOUISSEM, Salem HASNAOUI, Houria REZIG
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

CAN networks, called Controller Area Networks, can be used in the framework of real-time distributed industrial applications. Wireless CAN gives a solution when industrial mobile stations under certain constraints should continue to use the CAN protocol as a frame exchange protocol. In Wireless CAN, we adopt the use of the RTS/CTS mechanism to gain access to the medium in a first step and to exchange ordinary CAN frames in a second step. We focus, in this paper, on the performance evaluation of Wireless CAN by coupling the two criteria: the throughput and the latency time. After analyses, we deduce that when we increase the payload, the latency time along with the throughput increase respectively. Thus, in this way our work, in this paper, consists in computing the throughputlatency time couple that would guarantee a maximum throughput and minimum latency time in the case of WCAN
Traversal on DAG-based Multiresolution Mesh Hierarchy
Authors: Zhi Zheng, Tony K. Y. Chan
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Traversal algorithm on the multiresolution hierarchy is critical for the view-dependent level of detail system. In this paper, we study multiresolution hierarchy traversal for a DAG hierarchy of vertex-split/edge-collapse operations, in the context of a client-server based system. We present a general traversal management strategy that is beneficial for interactive frame rate and triangle-budget control, and is also favorable for the client-server based system. We adapt two commonly used traversal algorithms, linear traversal and priority-oriented traversal, to work under the management strategy. And we also propose a constant-time traversal algorithm. Extensive experiments on these three traversal algorithms are done and the comparison results can be used as a guide to choose the most appropriate traversal algorithm for different system requirements.
Circuits on cylinders
Authors: Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
Venue: Computational Complexity (2006)

We consider the computational power of constant width polynomial size cylindrical circuits and nondeterministic branching programs. We show that every function computed by a π2 MOD C0 circuit can also be computed by a constant width polynomial size cylindrical nondeterministic branching program (or cylindrical circuit) and that every function computed by a constant width polynomial size cylindrical circuit belongs to ACC0.
Book Reviews: Wireless Sensor Networks--Past, Present, and Future
Authors: Lu Yan
Venue: IEEE Distributed Systems Online (2006)

A review of Distributed Sensor Networks by S. Sitharama Iyengar and Richard R. Brooks.
Dynamic resource allocation in wdm networks with optical bypass and waveband switching
Authors: Eytan Modiano
Venue:  (2005)

In this thesis, we investigate network architecture from the twin perspectives of link resource allocation and node complexity in WDM optical networks. Chapter 2 considers networks where the nodes have full wavelength accessibility, and investigates link resource allocation in ring networks in the form of the routing and wavelength assignment problem. In a ring network with N nodes and P calls allowed per node, we show that a necessary and sufficient lower bound on the number of wavelengths required for rearrangeably non-blocking traffic is [PN/4] wavelengths. Two novel algorithms are presented: one that achieves this lower bound using at most two converters per wavelength, and a second requiring 2[PN /7] wavelengths that requires significantly fewer wavelength converters. Chapter 3 begins our investigation of the role of reduced-complexity nodes in WDM networks by considering networks with optical bypass. The ring, torus, and tree architectures are considered. For the ring, an optical bypass architecture is constructed that requires the minimum number of locally-accessible wavelengths, with the remaining wavelengths bypassing all but a small number of hub nodes. The routing and wavelength assignment for all non-hub nodes is statically assigned, and these nodes do not require dynamic switching capability. Routing and wavelength assignment algorithms are then developed for the torus and tree architectures, and this bypass approach is extended to these topologies also. Chapter 4 continues by considering waveband routing as a second method of reducing node complexity. We consider a two-dimensional performance space using number of wavelengths and wavebands as metrics in evaluating waveband switching networks. We derive bounds for the achievable performance region based on the minimum required number of wavelengths and wavebands. We then show by construction of several algorithms that a wavelength-waveband tradeoff frontier can be achieved that compares very favorably to the bounds. Finally, Chapter 5 concludes by considering hybrid networks with both static and a dynamic wavelength provisioning. We use an asymptotic analysis where we allow the number of users in the network to become large, and via a geometric argument derive the optimal static and dynamic provisioning (in both wavelength-switched and waveband-switched scenarios) as a function of the traffic statistics to achieve non-blocking performance. We then extend our results to networks with a finite (possibly small) number of users where a target overflow probability is allowed. We show that by using hybrid provisioning in conjunction with waveband switching, using just a small number of switches we can obtain performance very close to a fully dynamic wavelength-switched network. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
Authors: Yu Wang, Weizhao Wang, Xiang-Yang Li
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless ad hoc or sensor networks recently. Previous methods are mostly designed to minimize the size of the backbone. However, in many applications, it is desirable to construct a backbone with small cost when each wireless node has a cost of being in the backbone. In this paper, we first show that previous methods specifically designed to minimize the backbone size may produce a backbone with large cost. Then, an efficient distributed method to construct a weighted backbone with low cost is proposed. We prove that the total cost of the constructed backbone is within a small constant factor of the optimum for homogeneous networks when either the nodes' costs are smooth (i.e., the maximum ratio of costs of adjacent nodes is bounded) or the network maximum node degree is bounded. We also show that, with a small modification, the backbone is efficient for unicast: The total cost (or hop) of the least cost (or hop) path connecting any two nodes using backbone is no more than three (or four) times the least cost (or hop) path in the original communication graph. Our theoretical results are corroborated by our simulation studies. Finally, we discuss several possible ad hoc network applications of our proposed backbone formation algorithms.
Nonlinear time-frequency domain operators for decomposing sounds into loudness, pitch and timbre
Authors: M. Abe, S. Ando
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We propose a method for decomposing instantaneous changes of sounds into three energy components, i.e., loudness, pitch, and timbre. These operators are derived from an eigenstructure analysis of the time-frequency gradient space (a 3-D space spanned by a modulus and partial derivatives of a wavelet transform). By several experiments, we found that they have superior resolution and sensitivity for segmenting speech into phonemes, characterizing dynamical nature of musical sounds, and so on.
Failure classification and analysis of the Java Virtual Machine
Authors: Domenico Cotroneo, Salvatore Orlando, Stefano Russo
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

This paper presents a failure analysis of the Java Virtual Machine providing useful insights into the nature of reported failures and to improve the understanding of its dependability aspects. Failure data is extracted from publicly available bug databases, where developers and users of Java applications usually submit failures/bugs. Presented results clearly indicate that much more efforts have still to be done in order to improve the dependability of the JVM. In particular, the conducted analysis revealed that i) builtin error detection mechanism are characterized by a low coverage; ii) the JVM does not achieve the same levels of dependability across different platforms iii) developers have to pursue a tradeoff between performance and reliability. Finally, code fragments reproducing failures submitted in bug database are injected into Java Applications. Preliminary results show that often these faults could be removed changing the environment of the JVM.
Two-grid nonconforming finite element method for second order elliptic problems
Authors: Cheng Wang, Ziping Huang, Likang Li
Venue: Applied Mathematics and Computation (2006)

In this paper, we present and analyze two-grid P1 nonconforming finite element method for second order elliptic problems. The two-grid method involves solving one small origin problem on coarse grid with grid size H, and some correction problems on local fined grids with grid size h. If h = O(H2) is chosen, we show that the convergence rate of this two-grid method is optimal in broken H1-norm. Numerical results conforming the theory are also provided.