Siebel CRM Systems, Inc. was a software company principally engaged in the design, development, marketing, and support of customer relationship management applications. The company was founded by Thomas Siebel and Patricia House in 1993. At first known mainly for its sales force automation products, the company expanded into the broader CRM market. By the late 1990s, Siebel Systems was the dominant CRM vendor, peaking at 45% market share in 2002.On September 12, 2005, Oracle Corporation announced it had agreed to buy Siebel Systems for $5.8 billion. Siebel is now a brand name owned by Oracle Corporation. Wikipedia.
Masud M.M.,United Arab Emirates University |
Chen Q.,China National Petroleum Corporation |
Khan L.,University of Texas at Dallas |
Aggarwal C.C.,IBM |
And 4 more authors.
IEEE Transactions on Knowledge and Data Engineering | Year: 2013
Data stream classification poses many challenges to the data mining community. In this paper, we address four such major challenges, namely, infinite length, concept-drift, concept-evolution, and feature-evolution. Since a data stream is theoretically infinite in length, it is impractical to store and use all the historical data for training. Concept-drift is a common phenomenon in data streams, which occurs as a result of changes in the underlying concepts. Concept-evolution occurs as a result of new classes evolving in the stream. Feature-evolution is a frequently occurring process in many streams, such as text streams, in which new features (i.e., words or phrases) appear as the stream progresses. Most existing data stream classification techniques address only the first two challenges, and ignore the latter two. In this paper, we propose an ensemble classification framework, where each classifier is equipped with a novel class detector, to address concept-drift and concept-evolution. To address feature-evolution, we propose a feature set homogenization technique. We also enhance the novel class detection module by making it more adaptive to the evolving stream, and enabling it to detect more than one novel class at a time. Comparison with state-of-the-art data stream classification techniques establishes the effectiveness of the proposed approach. © 1989-2012 IEEE.
Agullo E.,French Institute for Research in Computer Science and Automation |
Coti C.,French Institute for Research in Computer Science and Automation |
Herault T.,French Institute for Research in Computer Science and Automation |
Herault T.,University Paris - Sud |
And 7 more authors.
Future Generation Computer Systems | Year: 2011
Computational grids present promising computational and storage capacities. They can be made by punctual aggregation of smaller resources (i.e., clusters) to obtain a large-scale supercomputer. Running general applications is challenging for several reasons. The first one is inter-process communication: processes running on different clusters must be able to communicate with one another in spite of security equipments such as firewalls and NATs. Another problem raised by grids for communication-intensive parallel application is caused by the heterogeneity of the available networks that interconnect processes with one another. In this paper we present how QCG-OMPI can execute efficient parallel applications on computational grids. We first present an MPI programming, communication and execution middleware called QCG-OMPI. We then present how applications can make use of the capabilities of QCG-OMPI by presenting two typical, parallel applications: a geophysics application combining collective operations and a masterworker scheme, and a linear algebra application. © 2010 Elsevier B.V. All rights reserved.
Termehchy A.,University of Illinois at Urbana - Champaign |
Termehchy A.,Siebel |
Winslett M.,University of Illinois at Urbana - Champaign
ACM Transactions on Database Systems | Year: 2011
The popularity of XML has exacerbated the need for an easy-to-use, high precision query interface for XML data. When traditional document-oriented keyword search techniques do not suffice, natural language interfaces and keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases. Unfortunately, current approaches to processing these queries rely heavily on heuristics that are intuitively appealing but ultimately ad hoc. These approaches often retrieve false positive answers, overlook correct answers, and cannot rank answers appropriately. To address these problems for data-centric XML, we propose coherency ranking (CR), a domain- and database designindependent ranking method for XML keyword queries that is based on an extension of the concepts of data dependencies and mutual information.With coherency ranking, the results of a keyword query are invariant under a class of equivalency-preserving schema reorganizations. We analyze the way in which previous approaches to XML keyword search approximate coherency ranking, and present efficient algorithms to process queries and rank their answers using coherency ranking. Our empirical evaluation with two realworld XML data sets shows that coherency ranking has better precision and recall and provides better ranking than all previous approaches. ©2011.
DeThorne L.,University of Illinois at Urbana - Champaign |
Aparicio Betancourt M.,University of Illinois at Urbana - Champaign |
Karahalios K.,Siebel |
Halle J.,University of Illinois at Urbana - Champaign |
Bogue E.,University of Illinois at Urbana - Champaign
Journal of Autism and Developmental Disorders | Year: 2015
Computerized technologies now offer unprecedented opportunities to provide real-time visual feedback to facilitate children’s speech–language development. We employed a mixed-method design to examine the effectiveness of two speech–language interventions aimed at facilitating children’s multisyllabic productions: one incorporated a novel computerized feedback system, VocSyl, while the other used a traditional noncomputerized pacing board. Eighteen children with a variety of diagnoses, all of whom were at the single word stage of development, enrolled in either one of the two explicit speech–language interventions (VocSyl or Pacing Board) or an active control group. Convergent findings between and within groups supported the effectiveness of the VocSyl condition. For the children with a clinical diagnosis of autism in particular, visual inspection of individual data on treatment versus control targets indicated positive treatment effects for both of the two children enrolled in the VocSyl condition and one of the two children enrolled in the Pacing Board condition. Although the study does not permit definitive conclusions about the effectiveness of any particular treatment tool or strategy in isolation, it offers preliminary support for the integration of real-time computerized feedback within speech–language intervention. © 2014, Springer Science+Business Media New York.
PubMed | Siebel and University of Illinois at Urbana - Champaign
Type: Controlled Clinical Trial | Journal: Journal of autism and developmental disorders | Year: 2015
Computerized technologies now offer unprecedented opportunities to provide real-time visual feedback to facilitate childrens speech-language development. We employed a mixed-method design to examine the effectiveness of two speech-language interventions aimed at facilitating childrens multisyllabic productions: one incorporated a novel computerized feedback system, VocSyl, while the other used a traditional noncomputerized pacing board. Eighteen children with a variety of diagnoses, all of whom were at the single word stage of development, enrolled in either one of the two explicit speech-language interventions (VocSyl or Pacing Board) or an active control group. Convergent findings between and within groups supported the effectiveness of the VocSyl condition. For the children with a clinical diagnosis of autism in particular, visual inspection of individual data on treatment versus control targets indicated positive treatment effects for both of the two children enrolled in the VocSyl condition and one of the two children enrolled in the Pacing Board condition. Although the study does not permit definitive conclusions about the effectiveness of any particular treatment tool or strategy in isolation, it offers preliminary support for the integration of real-time computerized feedback within speech-language intervention.
Johnson T.T.,University of Texas at Arlington |
Bak S.,U.S. Air force |
Caccamo M.,Siebel |
ACM Transactions on Embedded Computing Systems | Year: 2016
The Simplex architecture ensures the safe use of an unverifiable complex/smart controller by using it in conjunction with a verified safety controller and verified supervisory controller (switching logic). This architecture enables the safe use of smart, high-performance, untrusted, and complex control algorithms to enable autonomy without requiring the smart controllers to be formally verified or certified. Simplex incorporates a supervisory controller that will take over control from the unverified complex/smart controller if it misbehaves and use a safety controller. The supervisory controller should (1) guarantee that the system never enters an unsafe state (safety), but should also (2) use the complex/smart controller asmuch as possible (minimize conservatism). The problem of precisely and correctly defining the switching logic of the supervisory controller has previously been considered either using a control-theoretic optimization approach or through an offline hybrid-systems reachability computation. In this work, we show that a combined online/offline approach that uses aspects of the two earlier methods, along with a real-time reachability computation, also maintains safety, but with significantly less conservatism, allowing the complex controller to be used more frequently.We demonstrate the advantages of this unified approach on a saturated inverted pendulum system, inwhich the verifiable region of attraction is over twice as large compared to the earlier approach. Additionally, to validate the claims that the real-time reachability approach may be implemented on embedded platforms, we have ported and conducted embedded hardware studies using both ARM processors and Atmel AVR microcontrollers. This is the first ever demonstration of a hybrid-systems reachability computation in real time on actual embedded platforms, which required addressing significant technical challenges. © 2016 ACM.
Tran D.,Nanyang Technological University |
Yuan J.,Nanyang Technological University |
IEEE Transactions on Pattern Analysis and Machine Intelligence | Year: 2014
Although sliding window-based approaches have been quite successful in detecting objects in images, it is not a trivial problem to extend them to detecting events in videos. We propose to search for spatiotemporal paths for video event detection. This new formulation can accurately detect and locate video events in cluttered and crowded scenes, and is robust to camera motions. It can also well handle the scale, shape, and intraclass variations of the event. Compared to event detection using spatiotemporal sliding windows, the spatiotemporal paths correspond to the event trajectories in the video space, thus can better handle events composed by moving objects. We prove that the proposed search algorithm can achieve the global optimal solution with the lowest complexity. Experiments are conducted on realistic video data sets with different event detection tasks, such as anomaly event detection, walking person detection, and running detection. Our proposed method is compatible with different types of video features or object detectors and robust to false and missed local detections. It significantly improves the overall detection and localization accuracy over the state-of-the-art methods. © 2014 IEEE.
Gligoric M.,Siebel |
Jagannath V.,Siebel |
Luo Q.,Siebel |
Software Testing Verification and Reliability | Year: 2013
Mutation testing is a well-established method for measuring and improving the quality of test suites. A major cost of mutation testing is the time required to execute the test suite on all the mutants. This cost is even greater when the system under test is multithreaded: not only are test cases from the test suite executed on many mutants but also each test case is executed - or more precisely, explored - for multiple possible thread schedules. This paper introduces a general framework for efficient exploration that can reduce the time for mutation testing of multithreaded code. The paper presents five techniques (four optimizations and one heuristic) that are implemented in a tool called MuTMuT within the general framework. Evaluation of MuTMuT on mutation testing of 12 multithreaded programs shows that it can substantially reduce the time required for mutation testing of multithreaded code. Copyright © 2012 John Wiley & Sons, Ltd.
Lemay M.,Siebel |
IEEE Transactions on Smart Grid | Year: 2012
To mitigate the threat of malware intrusions on networked embedded systems, it is desirable to provide remote attestation assurances for them. Embedded systems have special limitations concerning cost, power efficiency, computation, and memory that influence how this goal can be achieved. Moreover, many types of applications require integrity guarantees for the system over an interval of time rather than just at a given instant. We propose a Cumulative Attestation Kernel (CAK) that addresses these concerns. We demonstrate the value of CAKs for Advanced Metering Infrastructure (AMI) and show how to implement a CAK in less than one quarter of the memory available on low end flash MCUs similar to those used in AMI deployments. Regarding this prototype, we present the first formal proof we are aware of that a system is tolerant to power supply interruptions. We also discuss how to provide cumulative attestation for devices with tighter memory constraints by offloading computation and storage onto a Cumulative Attestation Coprocessor (CAC). © 2012 IEEE.