Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Evolutionary Algorithms (2)
- Alternative Splicing (1)
- Attack Detection Model (1)
- Automated Population Size Tuning Method (1)
- Automatic Configuration (1)
-
- Cascading Failure (1)
- Cascading Failures (1)
- Cluster (1)
- Cluster securities (1)
- Coevolutionary Methodology (1)
- Combinatorial Complexity (1)
- Computational Argumentation (1)
- Computer Security (1)
- Computers (1)
- Conflict Resolution (1)
- Contracts (1)
- Data Allocation (1)
- Data Mining (1)
- Decomposition (1)
- Domain (1)
- Economic Model (1)
- FACTS Placement (1)
- Fault Tolerance (1)
- Flexible AC transmission systems (1)
- Formal specifications (1)
- Free-Riding (1)
- Frequency Domain (1)
- Fuzzy Logic (1)
- Gene Ontology (1)
- Genetic Programming (1)
Articles 1 - 15 of 15
Full-Text Articles in Physical Sciences and Mathematics
Time-Adaptive Numerical Simulation For High Speed Networks, Suman Kumar, Seung Jong Park, S. Sitharama Iyengar, Jung Han Kimn
Time-Adaptive Numerical Simulation For High Speed Networks, Suman Kumar, Seung Jong Park, S. Sitharama Iyengar, Jung Han Kimn
Computer Science Faculty Research & Creative Works
As the bandwidth of networks is increasing exponentially, the computational cost to simulate such type of networks is also growing in a similar fashion. This paper presents a scalable simulation method, called time-adaptive numerical simulation, which can be used to represent dynamics of high-speed networks using fluid-based models. The new method dynamically adjusts the size of a time step for a numerical solver which solves a system of differential equations representing dynamics of protocols and nodes' behaviors. The simulation results show that the time-adaptive-method reduces the computational time while achieving the same accuracy compared to that of a fixed step-size …
Enlightened Computing: An Architecture For Co-Allocating Network, Compute, And Other Grid Resources For High-End Applications, Lina Battestilli, Andrei Hutanut, Gigi Karmous-Edwards, Daniel S. Katz, Jon Maclarent, Joe Mambretti, John H. Moore, Seung Jong Park, Harry G. Perros, Syam Sundar, Savera Tanwir, Steven R. Thorpe, Yufeng Xin
Enlightened Computing: An Architecture For Co-Allocating Network, Compute, And Other Grid Resources For High-End Applications, Lina Battestilli, Andrei Hutanut, Gigi Karmous-Edwards, Daniel S. Katz, Jon Maclarent, Joe Mambretti, John H. Moore, Seung Jong Park, Harry G. Perros, Syam Sundar, Savera Tanwir, Steven R. Thorpe, Yufeng Xin
Computer Science Faculty Research & Creative Works
Many emerging high-performance applications require distributed infrastructure that is significantly more powerful and flexible than traditional Grids. Such applications require the optimization, close integration, and control of all Grid resources, including networks. The EnLIGHTened (ENL) Computing Project has designed an architectural framework that allows Grid applications to dynamically request (in-advance or on-demand) any type of Grid resource: computers, storage, instruments, and deterministic, high-bandwidth network paths, including lightpaths. Based on application requirements, the ENL middleware communicates with Grid resource managers and, when availability is verified, co-allocates all the necessary resources. ENL's Domain Network Manager controls all network resource allocations to dynamically …
Alternative Splicing: Associating Frequency With Isoforms, Anuradha Roy, Jennifer Leopold, Anne M. Maglia
Alternative Splicing: Associating Frequency With Isoforms, Anuradha Roy, Jennifer Leopold, Anne M. Maglia
Computer Science Faculty Research & Creative Works
In the simplest model of protein production, a gene gives rise to a single protein; DNA is transcribed to form pre-mRNA, which is converted to mRNA by splicing or removing introns. The result is a chain of exons that is translated to form a protein. Alternative splicing of exons may result in the formation of multiple proteins from the same gene sequence. However, not all of these proteins may be functional. Thus, we ask whether we can predict and rank (in order of frequency of occurrence and functional importance) the set of possible proteins for a gene. Herein we describe …
Use Of Max-Flow On Facts Devices, Adam Lininger, Bruce M. Mcmillin, Badrul H. Chowdhury, Mariesa Crow
Use Of Max-Flow On Facts Devices, Adam Lininger, Bruce M. Mcmillin, Badrul H. Chowdhury, Mariesa Crow
Computer Science Faculty Research & Creative Works
FACTS devices can be used to mitigate cascading failures in a power grid by controlling the power flow in individual lines. Placement and control are significant issues. We present a procedure for determining whether a scenario can be mitigated using the concept of maximum flow. If it can be mitigated, we determine what placement and control setting will solve the scenario. This paper treats fourteen cascading failure scenarios and reports on the use of the max-flow algorithm both in determining the mitigation of each scenario and in finding FACTS settings that will mitigate the scenario.
Determining Domain Similarity And Domain-Protein Similarity Using Functional Similarity Measurements Of Gene Ontology Terms, Lisa Michelle Guntly, Jennifer Leopold, Anne M. Maglia
Determining Domain Similarity And Domain-Protein Similarity Using Functional Similarity Measurements Of Gene Ontology Terms, Lisa Michelle Guntly, Jennifer Leopold, Anne M. Maglia
Computer Science Faculty Research & Creative Works
Protein domains typically correspond to major functional sites of a protein. Therefore, determining similarity between domains can aid in the comparison of protein functions, and can provide a basis for grouping domains based on function. One strategy for comparing domain similarity and domain-protein similarity is to use similarity measurements of annotation terms from the Gene Ontology (GO). In this paper five methods are analyzed in terms of their usefulness for comparing domains, and comparing domains to proteins based on GO terms.
Toward Automating Ea Configuration: The Parent Selection Stage, Ekaterina Smorodkina, Daniel R. Tauritz
Toward Automating Ea Configuration: The Parent Selection Stage, Ekaterina Smorodkina, Daniel R. Tauritz
Computer Science Faculty Research & Creative Works
One of the obstacles to Evolutionary Algorithms (EAs) fulfilling their promise as easy to use general-purpose problem solvers, is the difficulty of correctly configuring them for specific problems such as to obtain satisfactory performance. Having a mechanism for automatically configuring parameters and operators of every stage of the evolutionary life-cycle would give EAs a more widely spread popularity in the non-expert community. This paper investigates automatic configuration of one of the stages of the evolutionary life-cycle, the parent selection, via a new concept of semi-autonomous parent selection, where mate selection operators are encoded and evolved as in Genetic Programming. We …
Infrastructure Hardening: A Competitive Co-Evolutionary Methodology Inspired By Neo-Darwinian Arms Races, Travis Service, Daniel R. Tauritz, William M. Siever
Infrastructure Hardening: A Competitive Co-Evolutionary Methodology Inspired By Neo-Darwinian Arms Races, Travis Service, Daniel R. Tauritz, William M. Siever
Computer Science Faculty Research & Creative Works
The world is increasingly dependent on critical infrastructures such as the electric power grid, water, gas, and oil transport systems, which are susceptible to cascading failures that can result from a few faults. Due to the combinatorial complexity in the search spaces involved, most traditional search techniques are inappropriate for identifying these faults and potential protections against them. This paper provides a computational methodology employing competitive coevolution to simultaneously identify low-effort, high-impact faults and corresponding means of hardening infrastructures against them. A power system case study provides empirical evidence that our proposed methodology is capable of identifying cost effective modifications …
Specification Of Non-Functional Requirements For Contract Specification In The Ngoss Framework For Quality Management And Product Evaluation, Manooch Amoozdeh, Nektarios Georgalas, Xiaoqing Frank Liu
Specification Of Non-Functional Requirements For Contract Specification In The Ngoss Framework For Quality Management And Product Evaluation, Manooch Amoozdeh, Nektarios Georgalas, Xiaoqing Frank Liu
Computer Science Faculty Research & Creative Works
The community of operation support systems (OSS) for telecom applications defined a set of fundamental principles, processes, and architectures for developing the next generation OSS through the TeleManagement Forum TMF. At the heart of NGOSS lies the notion of a "contract" which embodies the specification of services offered by an OSS component for quality management and product evaluation. However, TMF does not provide any method (or process) for specification of the non-functional part in the NGOSS contract specification. In this paper, we develop a systematic approach for specifying non-functional requirements of telecom OSS applications for contracts in the NGOSS framework …
Survey Of Supercomputer Cluster Security Issues, George Markowsky, Linda Markowsky
Survey Of Supercomputer Cluster Security Issues, George Markowsky, Linda Markowsky
Computer Science Faculty Research & Creative Works
The authors believe that providing security for supercomputer clusters is different from providing security for stand-alone PCs. The types of programs that supercomputer clusters run and the sort of data available on supercomputer clusters are fundamentally different from the programs and data found on stand-alone PCs. This situation might attract a different type of attacker with different goals and different tactics. This paper discusses the results of a questionnaire sent out to many supercomputer clusters in the United States and relates them to a literature search that was also undertaken. These results suggest approaches that can be taken to further …
Conquer: A Peer Group-Based Incentive Model For Constraint Querying In Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa
Conquer: A Peer Group-Based Incentive Model For Constraint Querying In Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa
Computer Science Faculty Research & Creative Works
In mobile ad-hoc peer-to-peer (M-P2P) networks, economic models become a necessity for enticing non-cooperative mobile peers to provide service. M-P2P users may issue queries with varying constraints on query response time, data quality of results and trustworthiness of the data source. This work proposes ConQuer, which addresses constraint queries in economybased M-P2P networks. ConQuer proposes a broker-based incentive M-P2P model for handling user-defined constraint queries. It also provides incentives for MPs to form collaborative peer groups for maximizing data availability and revenues by mutually allocating and deallocating data items using a royalty-based revenue-sharing method. Such reallocations facilitate MPs in providing …
Management Of An Intelligent Argumentation Network For A Web-Based Collaborative Engineering Design Environment, Xiaoqing Frank Liu, Man Zheng, Ganesh K. Venayagamoorthy, Ming-Chuan Leu
Management Of An Intelligent Argumentation Network For A Web-Based Collaborative Engineering Design Environment, Xiaoqing Frank Liu, Man Zheng, Ganesh K. Venayagamoorthy, Ming-Chuan Leu
Computer Science Faculty Research & Creative Works
Conflict resolution is one of the most challenging tasks in collaborative engineering design. In our previous research, a web-based intelligent collaborative system was developed to address this challenge based on intelligent computational argumentation. However, two important issues were not resolved in that system: priority of participants and self-conflicting arguments. In this paper, we develop two methods for incorporating priorities of participants into the computational argumentation network: 1) weighted summation and 2) re-assessment of strengths of arguments based on priority of owners of the argument using fuzzy logic inference. In addition, we develop a method for detection of self-conflicting arguments. Incorporation …
Energy-Efficient Group Key Management Protocols For Hierarchical Sensor Networks, Biswajit Panja, Sanjay Kumar Madria, Bharat Bhargava
Energy-Efficient Group Key Management Protocols For Hierarchical Sensor Networks, Biswajit Panja, Sanjay Kumar Madria, Bharat Bhargava
Computer Science Faculty Research & Creative Works
In this paper, we describe a group key management protocol for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dynamically using a function. The function takes partial keys of its children as arguments. The design of the protocol is motivated by the fact that traditional cryptographic techniques are impractical in sensor networks because of associated high energy and computational overheads. The group key management protocol supports the establishment of two types of group keys; one for the nodes within a group (intra-cluster), and the other among a group of cluster heads (inter-cluster). …
An Automatically Tuning Intrusion Detection System, Zhenwei Yu, Jeffrey J.-P. Tsai, Thomas Weigert
An Automatically Tuning Intrusion Detection System, Zhenwei Yu, Jeffrey J.-P. Tsai, Thomas Weigert
Computer Science Faculty Research & Creative Works
An intrusion detection system (IDS) is a security layer used to detect ongoing intrusive activities in information systems. Traditionally, intrusion detection relies on extensive knowledge of security experts, in particular, on their familiarity with the computer system to be protected. To reduce this dependence, various data-mining and machine learning techniques have been deployed for intrusion detection. An IDS is usually working in a dynamically changing environment, which forces continuous tuning of the intrusion detection model, in order to maintain sufficient performance. The manual tuning process required by current systems depends on the system operators in working out the tuning solution …
Greedy Population Sizing For Evolutionary Algorithms, Ekaterina Smorodkina, Daniel R. Tauritz
Greedy Population Sizing For Evolutionary Algorithms, Ekaterina Smorodkina, Daniel R. Tauritz
Computer Science Faculty Research & Creative Works
The number of parameters that need to be man ually tuned to achieve good performance of Evolutionary Algorithms and the dependency of the parameters on each other make this potentially robust and efficient computational method very time consuming and difficult to use. This paper introduces a Greedy Population Sizing method for Evolutionary Algo rithms (GPS-EA), an automated population size tuning method that does not require any population size related parameters to be specified or manually tuned a priori. Theoretical analysis of the number of function evaluations needed by the GPS EA to produce good solutions is provided. We also perform …
Verifying Noninterference In A Cyber-Physical System The Advanced Electric Power Grid, David Cape, Xiaoqing Frank Liu, Bruce M. Mcmillin, Yan Sun
Verifying Noninterference In A Cyber-Physical System The Advanced Electric Power Grid, David Cape, Xiaoqing Frank Liu, Bruce M. Mcmillin, Yan Sun
Computer Science Faculty Research & Creative Works
The advanced electric power grid is a complex real-time system having both cyber and physical components. While each component may function correctly, independently, their composition may yield incorrectness due to interference. One specific type of interference is in the frequency domain, essentially, violations of the Nyquist rate. The challenge is to encode these signal processing problem characteristics into a form that can be model checked. To verify the correctness of the cyber-physical composition using model-checking techniques requires that a model be constructed that can represent frequency interference. In this paper, RT-PROMELA was used to construct the model, which was checked …