Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Selected Works

2008

Institution
Keyword
Publication
File Type

Articles 61 - 90 of 153

Full-Text Articles in Physical Sciences and Mathematics

Hclp Based Service Composition, Ying Guan, Aditya K. Ghose, Zheng Lu May 2008

Hclp Based Service Composition, Ying Guan, Aditya K. Ghose, Zheng Lu

Professor Aditya K. Ghose

A key impediment to the widespread adoption of web services is the relatively limited set of tools available to deal with Quality-of-Service (QoS) factors. QoS factors pose several difficult challenges in how they may be articulated. While the functional requirements of a service can be represented as predicates to be satisfied by the target system, QoS factors are effectively statements of objectives to be maximized or minimized. QoS requirements occur naturally as local specifications of preference. Dealing with QoS factors is therefore a multi-objective optimization problem. In effect, these objectives are never fully satisfied, but satisficed to varying degrees. In …


Auditing Business Process Compliance, Aditya K. Ghose, George Koliadis May 2008

Auditing Business Process Compliance, Aditya K. Ghose, George Koliadis

Professor Aditya K. Ghose

Compliance issues impose significant management and reporting requirements upon organizations.We present an approach to enhance business process modeling notations with the capability to detect and resolve many broad compliance related issues. We provide a semantic characterization of a minimal revision strategy that helps us obtain compliant process models from models that might be initially non-compliant, in a manner that accommodates the structural and semantic dimensions of parsimoniously annotated process models. We also provide a heuristic approach to compliance resolution using a notion of compliance patterns. This allows us to partially automate compliance resolution, leading to reduced levels of analyst involvement …


Using Constraint Hierarchies To Support Qos-Guided Service Composition, Ying Guan, Aditya K. Ghose, Zheng Lu May 2008

Using Constraint Hierarchies To Support Qos-Guided Service Composition, Ying Guan, Aditya K. Ghose, Zheng Lu

Professor Aditya K. Ghose

A key impediment to the widespread adoption of web services is the is the relatively limited set of tools available to deal with Quality-of-Service (QoS) factors [12]. QoS factors pose several difficult challenges in how they may be articulated. While the functional requirements of a service can be represented as predicates to be satisfied by the target system, QoS factors are effectively statements of objectives to be maximized or minimized. QoS requirements occur naturally as local specifications of preference. Dealing with QoS factors is therefore a multi-objective optimization problem. In effect, these objectives are never fully satisfied, but satisficed to …


Process Discovery From Model And Text Artefacts, Aditya K. Ghose, George Koliadis, Arthur Cheung May 2008

Process Discovery From Model And Text Artefacts, Aditya K. Ghose, George Koliadis, Arthur Cheung

Professor Aditya K. Ghose

Modeling is an important and time consuming part of the Business Process Management life-cycle. An analyst reviews existing documentation and queries relevant domain experts to construct both mental and concrete models of the domain. To aid this exercise, we propose the Rapid Business Process Discovery (R-BPD) framework and prototype tool that can query heterogeneous information resources (e.g. corporate documentation, web-content, code e.t.c.) and rapidly construct proto-models to be incrementally adjusted to correctness by an analyst. This constitutes a departure from building and constructing models toward just editing them. We believe this rapid mixed-initiative modeling will increase analyst productivity by significant …


Combining Agent-Oriented Conceptual Modelling With Formal Methods, S. A. Vilkomir, Aditya K. Ghose, A. Krishna May 2008

Combining Agent-Oriented Conceptual Modelling With Formal Methods, S. A. Vilkomir, Aditya K. Ghose, A. Krishna

Professor Aditya K. Ghose

Agent-oriented conceptual modelling notations such as i* have received considerable recent attention as a useful approach to early-phase requirements engineering. Agent-oriented conceptual modelling notations are highly effective in representing requirements from an intentional stance and answering questions such as what goals exist, how key actors depend on each other and what alternatives must be considered. Formal methods such as those based on the Z notation offer a complementary set of representational facilities. We explore how these two otherwise disparate approaches might be used in a synergistic fashion.


Executable Specifications For Agent Oriented Conceptual Modelling, Y. Guan, Aditya K. Ghose May 2008

Executable Specifications For Agent Oriented Conceptual Modelling, Y. Guan, Aditya K. Ghose

Professor Aditya K. Ghose

Agent-oriented conceptual modelling (AoCM) notations such as i* have received considerable recent attention as a useful approach to early-phase requirements engineering. AoCM notations are useful in modeling organizational context and in offering high-level anthropomorphic abstractions as modeling constructs. AoCM notations such as i* help answer questions such as what goals exist, how key actors depend on each other and what alternatives must be considered. In this paper, we suggest an approach to executing i* models by translating these into set of interacting agents implemented in the 3APL language. In addition, we suggest a hybrid modeling, or co-evolution, approach in which …


Hierarchic Decomposition In Agent Oriented Conceptual Modelling, R. B. Brown, Aditya K. Ghose May 2008

Hierarchic Decomposition In Agent Oriented Conceptual Modelling, R. B. Brown, Aditya K. Ghose

Professor Aditya K. Ghose

Software development processes requires a thorough understanding of stakeholder objectives and requirements. Product-centrism is an insufficient stance from which to achieve greater efficiencies and reduce reengineering. Stakeholder requirement elicitation is thus worthy of formalization. A suite of tools, notably the i* model, provides a framework for early-phase requirements capture. These tools currently are at best only semiautomated and essentially consist of a notational glossary and sets of mark-up symbols. Increasing formalization may lead to greater automation of the process in the future, but currently there is a degree of flexibility that presents pitfalls for the unwary practitioner. A notion of …


Co-Evolution Of Agent Oriented Conceptual Models And Use Case Diagrams, Moshiur Bhuiyan, M. M. Zahidul Islam, Aneesh Krishna, Aditya K. Ghose May 2008

Co-Evolution Of Agent Oriented Conceptual Models And Use Case Diagrams, Moshiur Bhuiyan, M. M. Zahidul Islam, Aneesh Krishna, Aditya K. Ghose

Professor Aditya K. Ghose

Agent--oriented conceptual modeling notations such as i* represents an interesting approach for modeling early phase requirements which includes organizational contexts, stakeholder intentions and rationale. On the other hand Use Case diagram is used for capturing functional requirements of the system. The integration of i* model and Use Case diagram closes the gap of capturing organizational requirements and system requirements. But in both contexts the requirements might change at any time. Any change made in one model must be reflected in the other. This paper proposes a methodology supporting the co-evolution of these two otherwise disparate approaches in a synergistic fashion.


Co-Evolution Of Agent-Oriented Conceptual Models And Caso Agent Programs, A. Dasgupta, Aneesh Krishna, Aditya K. Ghose May 2008

Co-Evolution Of Agent-Oriented Conceptual Models And Caso Agent Programs, A. Dasgupta, Aneesh Krishna, Aditya K. Ghose

Professor Aditya K. Ghose

Agent-Oriented conceptual modelling notations are highly effective in representing requirements from an intentional stance and answering questions such as what goals exist, how key actors depend on each other and what alternatives must be considered. In this paper, we suggest an approach to executing i* models by translating these into set of interacting agents implemented in the CASO language. In addition, we suggest a hybrid modelling, or co-evolution, approach in which i* models and CASO agent programs are concurrently maintained and updated, while retaining some modicum of loose consistency between the two. This allows us to benefit from the complementary …


A Combined Approach For Supporting The Business Process Model Lifecycle, George Koliadis, Aleksander Vranesevic, Moshiur Bhuiyan, Aneesh Krishna, Aditya K. Ghose May 2008

A Combined Approach For Supporting The Business Process Model Lifecycle, George Koliadis, Aleksander Vranesevic, Moshiur Bhuiyan, Aneesh Krishna, Aditya K. Ghose

Professor Aditya K. Ghose

Business processes evolve throughout their lifecycle of change. Business Process Modeling (BPM2) notations such as BPMN are used to effectively conceptualize and communicate important process characteristics to relevant stakeholders. Agent-oriented conceptual modeling notations, such as i*, effectively capture and communicate organizational context. In this paper we argue that the management of change throughout the business process model lifecycle can be more effectively supported by combining notations. In particular, we identify two potential sources of process change, one occurring within the organizational context and the other within the operational context. As such the focus in this paper is on the co-evolution …


Development Of Multi-Objective Simulation-Based Genetic Algorithm For Supply Chain Cyclic Planning And Optimisation, Galina Merkuryeva, Liana Napalkova May 2008

Development Of Multi-Objective Simulation-Based Genetic Algorithm For Supply Chain Cyclic Planning And Optimisation, Galina Merkuryeva, Liana Napalkova

Liana Napalkova

No abstract provided.


The (In)Essentiality Of Monopoly Power In Network Neutrality Violations, Matthias Bärwolff May 2008

The (In)Essentiality Of Monopoly Power In Network Neutrality Violations, Matthias Bärwolff

Matthias Bärwolff

It has recently been proposed that competition in the provision of internet access does not obtain the normative goals of network neutrality proponents. Even under competition internet access providers will still have substantial incentives to discriminate against independent providers' content and applications.

We argue that this argument effectively conforms to basic insights from models of monopolistic competition and, in itself, holds little of the policy relevance alleged by network neutrality advocates. Without empirical validation the conclusions of such an argument-an urgent call for material network neutrality regulation-is unjustified.

Further, we point to the duality of the discrimination problem, for the …


On Searching Compressed String Collections Cache-Obliviously, Ankur Gupta, Paolo Ferragina, Roberto Grossi, Rahul Shah, Jeffrey Vitter Apr 2008

On Searching Compressed String Collections Cache-Obliviously, Ankur Gupta, Paolo Ferragina, Roberto Grossi, Rahul Shah, Jeffrey Vitter

Ankur Gupta

Current data structures for searching large string collections either fail to achieve minimum space or cause too many cache misses. In this paper we discuss some edge linearizations of the classic trie data structure that are simultaneously cache-friendly and compressed. We provide new insights on front coding [24], introduce other novel linearizations, and study how close their space occupancy is to the information-theoretic minimum. The moral is that they are not just heuristics. Our second contribution is a novel dictionary encoding scheme that builds upon such linearizations and achieves nearly optimal space, offers competitive I/O-search time, and is also conscious …


Criteria On Utility Designing Of Convex Optimization In Fdma Networks, Zheng Sun, Wenjun Xu, Zhiqiang He, Kai Niu Apr 2008

Criteria On Utility Designing Of Convex Optimization In Fdma Networks, Zheng Sun, Wenjun Xu, Zhiqiang He, Kai Niu

Zheng Sun

In this paper, we investigate the network utility maximization problem in FDMA systems. We summarize with a suite of criteria on designing utility functions so as to achieve the global optimization convex. After proposing the general form of the utility functions, we present examples of commonly used utility function forms that are consistent with the criteria proposed in this paper, which include the well-known proportional fairness function and the sigmoidal-like functions. In the second part of this paper, we use numerical results to demonstrate a case study based on the criteria mentioned above, which deals with the subcarrier scheduling problem …


Understanding The Role Of Noise In Stochastic Local Search: Analysis And Experiments, Ole J. Mengshoel Apr 2008

Understanding The Role Of Noise In Stochastic Local Search: Analysis And Experiments, Ole J. Mengshoel

Ole J Mengshoel

Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number of parameters, optimized empirically, that characterize and determine their performance. In this article, we focus on the noise parameter. The theoretical foundation of SLS, including an understanding of how to the optimal noise varies with problem difficulty, is lagging compared to the strong empirical results obtained using these algorithms. A purely empirical approach to understanding and optimizing SLS noise, as problem instances vary, can be very computationally intensive. To complement existing experimental results, we …


Dioxidobis(2-Oxo-1,2-Dihydropyridin-3-Olato)­Molybdenum(Vi), Manoj Trivedi, Daya Shankar Pandey, Nigam P. Rath Apr 2008

Dioxidobis(2-Oxo-1,2-Dihydropyridin-3-Olato)­Molybdenum(Vi), Manoj Trivedi, Daya Shankar Pandey, Nigam P. Rath

Nigam Rath

In the title compound, [Mo(C5H4NO2)2O2], the MoVI atom exhibits a distorted octa­hedral coordination geometry formed by two terminal oxo ligands and two monoanionic O,O-bidentate pyridinone ligands. The two terminal oxo ligands lie in a cis arrangement, the ketonic O atoms of the pyridinone ligands are coordinated trans to the oxo ligands and the deprotonated hydroxyl O atoms are located trans to each other. The crystal structure contains inter­molecular N-H...O hydrogen bonds, C-H...O contacts and face-to-face [pi]-[pi] stacking inter­actions with an inter­planar separation of 3.25 (1) Å.


Diethyl 2-[(4-Nitro­Phen­Yl)(4-Phenyl-1,2,3-Selenadiazol-5-Yl)Meth­Yl]Malonate, A. Marx, S. Saravanan, S. Muthusubramanian, V. Manivannan, Nigam P. Rath Apr 2008

Diethyl 2-[(4-Nitro­Phen­Yl)(4-Phenyl-1,2,3-Selenadiazol-5-Yl)Meth­Yl]Malonate, A. Marx, S. Saravanan, S. Muthusubramanian, V. Manivannan, Nigam P. Rath

Nigam Rath

In the title compound, C22H21N3O6Se, the heterocyclic ring makes dihedral angles of 50.03 (11) and 67.75 (11)°, respectively, with the benzene and phenyl rings. The terminal C atoms of the ester groups are disordered over two positions: the site occupancies for the C atoms are 0.62 (3)/0.38 (3) and 0.48 (3)/0.52 (3). In the crystal structure, weak intra- and inter­molecular C-H...O inter­actions are observed.


Constant-Time Query Processing, Vijayshankar Raman, Garret Swart, Lin Qiao, Frederick Reiss, Vijay Dialani, Donald Kossmann, Inderpal Narang, Richard Sidle Apr 2008

Constant-Time Query Processing, Vijayshankar Raman, Garret Swart, Lin Qiao, Frederick Reiss, Vijay Dialani, Donald Kossmann, Inderpal Narang, Richard Sidle

Vijay Dialani

Query performance in current systems depends significantly on tuning: how well the query matches the available indexes, materialized views etc. Even in a well tuned system, there are always some queries that take much longer than others. This frustrates users who increasingly want consistent response times to ad hoc queries. We argue that query processors should instead aim for constant response times for all queries, with no assumption about tuning. We present Blink, our first attempt at this goal, that runs every query as a table scan over a fully denormalized database, with hash group-by done along the way. …


Knowledge Management Enterprise Services (Kmes): Concepts And Implementation Principles, Jens G. Pohl Apr 2008

Knowledge Management Enterprise Services (Kmes): Concepts And Implementation Principles, Jens G. Pohl

Jens G. Pohl

The purpose of this paper is to present concepts and implementation principles related to the design and development of reusable software services that are capable of assisting users at the operational level. Knowledge Management Enterprise Services (KMES) are an implementation of the service-oriented architecture paradigm, with a focus on the exchange of data within the meaningful context of a particular application (i.e., knowledge) domain. This requires a KMES service to incorporate a high level representation of this knowledge domain in the form of an ontology that is shared among all collaborating services within the application environment and at the same …


Theoretical Framework Of Multi-Objective Simulation-Based Genetic Algorithm For Supply Chain Cyclic Planning And Optimisation, Liana Napalkova, Galina Merkuryeva Apr 2008

Theoretical Framework Of Multi-Objective Simulation-Based Genetic Algorithm For Supply Chain Cyclic Planning And Optimisation, Liana Napalkova, Galina Merkuryeva

Liana Napalkova

No abstract provided.


Google Android Masses (Android), Chien Hsun Chen, Flow Lin Apr 2008

Google Android Masses (Android), Chien Hsun Chen, Flow Lin

Chien Hsun Chen

Google Android Masses is a web2.0 social network application based on mobile, made by Chien-Hsun Chen and Flow. http://video.google.com/videoplay?docid=-1939321648198893927&hl=en http://www.slideshare.net/lucemia/gam-documentation/


Genetic Algorithms For Synthesis Design Of Metamaterials. (In Chinese), Chien Hsun Chen, P. Y. Chen Apr 2008

Genetic Algorithms For Synthesis Design Of Metamaterials. (In Chinese), Chien Hsun Chen, P. Y. Chen

Chien Hsun Chen

No abstract provided.


Three-Dimensional Data Merging Using Holoimage, Song Zhang, Shing-Tung Yau Mar 2008

Three-Dimensional Data Merging Using Holoimage, Song Zhang, Shing-Tung Yau

Song Zhang

Three-dimensional data merging is vital for full-field three-dimensional (3D) shape measurement. All 3D range data patches, acquired from either different sensors or the same sensor in different viewing angles, have to be merged into a single piece to facilitate future data analysis. A novel method for 3D data merging using Holoimage is proposed. Similar to the 3D shape measurement system using a phase-shifting method, Holoimage is a phase-shifting–based computer synthesized fringe image. The 3D information is retrieved from Holoimage using a phase-shifting method. If two patches of 3D data with overlapping areas are rendered by OpenGL, the overlapping areas are …


Information Commons To Go, Marc D. Bayer Feb 2008

Information Commons To Go, Marc D. Bayer

Marc D Bayer

This article describes the concept of a virtual information commons based not on the Web but on portable drives. ic2go is a collection of portable applications that are served from your USB device by a portable Web server. The applications have been configured to work properly and to include valuable support resources for the end user.


A Hybrid Approach To Projects In Gaming Courses, Amber Settle, Joe Linhoff, André Berthiaume Feb 2008

A Hybrid Approach To Projects In Gaming Courses, Amber Settle, Joe Linhoff, André Berthiaume

Amber Settle

We describe an approach to projects used in game development courses that supports learning individual skills while also developing team skills. Early assignments focus on developing individual skills in coding and content creation, and when those skills are honed, students form teams to work on a larger and more complex game. Classes that use a hybrid approach, that is individual projects that build toward a large group project, allow students to solidly learn game development skills required of gaming graduates and yet stimulate creativity and challenge students to move beyond their comfort zone. 


4-(4-Chlorophenyl)-5-[1-(4-Chlorophenyl)-2-Methyl-2-Nitropropyl]-1,2,3-Selenadiazole, A. Marx, S. Saravanan, S. Muthusubramanian, V. Manivannan, Nigam P. Rath Feb 2008

4-(4-Chlorophenyl)-5-[1-(4-Chlorophenyl)-2-Methyl-2-Nitropropyl]-1,2,3-Selenadiazole, A. Marx, S. Saravanan, S. Muthusubramanian, V. Manivannan, Nigam P. Rath

Nigam Rath

In the title compound, C18H15Cl2N3O2Se, the selenadiazole ring makes dihedral angles of 49.87 (3) and 55.70 (3)° with the two benzene rings. The dihedral angle between the two benzene rings is 11.90 (5)°. In the crystal structure, intra­molecular C-H...O and C-H...Se inter­actions and inter­molecular C-H...O, C-H...Cl and C-H...N inter­actions are observed.


Sensor Validation Using Bayesian Networks, Ole J. Mengshoel, Adnan Darwiche, Serdar Uckun Jan 2008

Sensor Validation Using Bayesian Networks, Ole J. Mengshoel, Adnan Darwiche, Serdar Uckun

Ole J Mengshoel

One of NASA’s key mission requirements is robust state estimation. Sensing, using a wide range of sensors and sensor fusion approaches, plays a central role in robust state estimation, and there is a need to diagnose sensor failure as well as component failure. Sensor validation techniques address this problem: given a vector of sensor readings, decide whether sensors have failed, therefore producing bad data. We take in this paper a probabilistic approach, using Bayesian networks, to diagnosis and sensor validation, and investigate several relevant but slightly different Bayesian network queries. We emphasize that onboard inference can be performed on a …


Three-Dimensional Shape Measurement Using A Structured Light System With Dual Cameras, Song Zhang, Shing-Tung Yau Jan 2008

Three-Dimensional Shape Measurement Using A Structured Light System With Dual Cameras, Song Zhang, Shing-Tung Yau

Song Zhang

A structured light system for three-dimensional shape measurement with single camera has the shortcoming of camera occlusion. To alleviate this problem, this paper introduces a structured light system with dual cameras for three-dimensional shape measurement. We discuss (1) system description, (2) system calibration, (3) three-dimensional data registration using the iterative closest-point (ICP) algorithm, and (4) three-dimensional data merging using holoimage. The principle of the system is introduced, and experiments are presented to verify its performance.


Autonomous Estimates Of Horizontal Decorrelation Lengths For Digital Elevation Models, Andres Corrada-Emmanuel, Howard Schultz Jan 2008

Autonomous Estimates Of Horizontal Decorrelation Lengths For Digital Elevation Models, Andres Corrada-Emmanuel, Howard Schultz

Andrés Corrada-Emmanuel

The precision errors in a collection of digital elevation models (DEMs) can be estimated in the presence of large but sparse correlations even when no ground truth is known. We demonstrate this by considering the problem of how to estimate the horizontal decorrelation length of DEMs produced by an automatic photogrammetric process that relies on the epipolar constraint equations. The procedure is based on a set of autonomous elevation difference equations recently proposed by us. In this paper we show that these equations can only estimate the precision errors of DEMs. The accuracy errors are unknowable since there is no …


A Hidden Markov Model For Alphabet-Soup Word Recognition, Shaolei Feng, Nicholas Howe, R. Manmatha Jan 2008

A Hidden Markov Model For Alphabet-Soup Word Recognition, Shaolei Feng, Nicholas Howe, R. Manmatha

R. Manmatha

Recent work on the ``alphabet soup'' paradigm has demonstrated effective segmentation-free character-based recognition of cursive handwritten historical text documents. The approach first uses a joint boosting technique to detect potential characters - the alphabet soup. A second stage uses a dynamic programming algorithm to recover the correct sequence of characters. Despite experimental success, the ad hoc dynamic programming method previously lacked theoretical justification. This paper puts the method on a sounder footing by recasting the dynamic programming as inference on an ensemble of hidden Markov models (HMMs). Although some work has questioned the use of score outputs from classifiers like …