Filters








11,368 Hits in 5.2 sec

Cloud-Based K-Closest Pairs Discovery in Dynamic Cyber-Physical-Social Systems

Junwen Lu, Guanfeng Liu, Xianmei Hua
2020 IEEE Access  
However, the k-CP problem has not been well studied in Dynamic Cyber-Physical-Social Systems (D-CPSS), where temporal information and multiple attributes are associated with each edge.  ...  In this paper, we study the temporal multiple constraints k closest pairs (TMC-k-CP) in D-CPSS, which is NP-Complete.  ...  These temporal graphs have been widely used in the literature to study the temporal path discovery in temporal graphs [31] .  ... 
doi:10.1109/access.2020.2985103 fatcat:jyzalueu5realnltcnmt6dzgoa

Routing with confidence: supporting discretionary routing requirements in policy based networks

Apu Kapadia, Prasad Naldurg, R.H. Campbell
2004 Proceedings. Fifth IEEE International Workshop on Policies for Distributed Systems and Networks, 2004. POLICY 2004.  
In contrast to existing research that focuses mainly on restricting network access based on user credentials, we present a model that allows users to specify discretionary constraints on path characteristics  ...  and discover routes based on situational trust attributes of routers in a network.  ...  Users are allowed to update this map with dynamic attributes at any point in time.  ... 
doi:10.1109/policy.2004.1309149 dblp:conf/policy/KapadiaNC04 fatcat:ib35mf3xgjbmramjugcp62nedy

Unsupervised Pattern Discovery in Speech

Alex S. Park, James R. Glass
2008 IEEE Transactions on Audio, Speech, and Language Processing  
Instead, we attempt to discover such an inventory in an unsupervised manner by exploiting the structure of repeating patterns within the speech signal.  ...  We present a novel approach to speech processing based on the principle of pattern discovery.  ...  In addition to limiting temporal skew, the constraint in (3) also introduces a natural division of the search grid into regions suitable for generating multiple alignment paths with offset start coordinates  ... 
doi:10.1109/tasl.2007.909282 fatcat:ajmbm46jqfewrelanuzl5bdgzy

OASiS: A Service-Oriented Architecture for Ambient-Aware Sensor Networks [chapter]

Xenofon Koutsoukos, Manish Kushwaha, Isaac Amundson, Sandeep Neema, Janos Sztipanovits
2008 Lecture Notes in Computer Science  
This paper presents OASiS, a lightweight service-oriented architecture for sensor networks, which provides dynamic service discovery and can be used to develop ambient-aware applications that adapt to  ...  An important advantage of OASiS is that it allows seamless integration with Web services.  ...  Specifically, a service graph contains a set of services, a set of bindings, and a set of constraints, where a binding is a connection between two services, and a constraint is a restrictive attribute  ... 
doi:10.1007/978-3-540-77419-8_8 fatcat:imgafj5azndlrhvnixrmhqfqie

Discovering Dynamic Classification Hierarchies in OLAP Dimensions [chapter]

Nafees Ur Rehman, Svetlana Mansmann, Andreas Weiler, Marc H. Scholl
2012 Lecture Notes in Computer Science  
Discovered elements are dynamic by nature and evolve along with the underlying data set.  ...  These constraints appear too rigid for many data sets, especially semi-structured ones, such as user-generated content in social networks and other web applications.  ...  Multiple aggregation paths are possible within a dimension, all converging in an abstract T node, which corresponds to the aggregated value all.  ... 
doi:10.1007/978-3-642-34624-8_48 fatcat:lmynmjnewbev7krdfpeadz4rry

Motif discovery algorithms in static and temporal networks: A survey

Ali Jazayeri, Christopher C Yang, Peter Holme
2020 Journal of Complex Networks  
The complexities associated with graph and subgraph isomorphism problems, as the core of frequent subgraph mining, directly impact the performance of motif discovery algorithms.  ...  In this article, we provide a survey of motif discovery algorithms proposed in the literature for mining static and temporal networks and review the corresponding algorithms based on their adopted strategies  ...  In this algorithm, each vertex might have two types of attributes, a dynamic attribute and a fixed label, at the same time.  ... 
doi:10.1093/comnet/cnaa031 fatcat:7hasephaffajdl5bn7gl33qn2a

Proceedings 2002 IEEE International Conference on Data Mining. ICDM 2002

2002 2002 IEEE International Conference on Data Mining 2002 Proceedings ICDM-02  
Choi viii User-Directed Exploration of Mining Space with Multiple Attributes .............. 394 C:S. Perng, H. Wang, S. Ma, and J.  ...  Adams Speed-up Iterative Frequent Itemset Mining with Constraint Changes ..................  ... 
doi:10.1109/icdm.2002.1183878 fatcat:3iufo7cncbbzbn7cwjme73wrpm

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

Dongshuang Li, Zhaoyuan Yu, Wen Luo, Yong Hu, Xiaoyu Che, Linwang Yuan
2018 ISPRS International Journal of Geo-Information  
As most existing multiple constrained optimal path (MCOP) methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple  ...  but constraints in the network analysis are represented mainly as attributes or evaluation rules.  ...  Preliminary and Basic Ideas Definition of the DMCOP with Type II Dynamics Given the graph G = (V, E), each path P(i, j) ∈ G (i, j ∈ V) in the graph contains a main cost weight M ∑ m=1 W m (P(i, j)) ,  ... 
doi:10.3390/ijgi7050172 fatcat:gefbldxh4nd23pieuo5djs4c5m

Challenges for Dynamic Heterogeneous Networks in Observational Sciences [chapter]

Lisa Singh
2008 Chapman & Hall/CRC Data Mining and Knowledge Discovery Series  
In reality, many different link types may exist between any twc nodes in the graph. Each node and each edge in Figure 20 .1 also has a set of features or attributes associated with it.  ...  Formally, a more generic graph c' that captures any number of node types and edge types can A multi-feature graph has features or attributes associated with each node and each edge in the graph.  ... 
doi:10.1201/9781420085877.ch20 fatcat:hkwx7ggg4ncybgmvvisfadubeu

Time-Dependent Graphs: Definitions, Applications, and Algorithms

Yishu Wang, Ye Yuan, Yuliang Ma, Guoren Wang
2019 Data Science and Engineering  
In particular, the time-dependent graph is a very broad concept, which is reflected in the related research with many names, including temporal graphs, evolving graphs, time-varying graphs, historical  ...  In such graphs, the weights associated with edges dynamically change over time, that is, the edges in such graphs are activated by sequences of time-dependent elements.  ...  Next, find an edge set in which all edges match with this edge in the data graph and decompose the data graph into multiple subgraphs.  ... 
doi:10.1007/s41019-019-00105-0 fatcat:7x434vpbefatbmudkobahvtd5y

Motif Discovery Algorithms in Static and Temporal Networks: A Survey [article]

Ali Jazayeri, Christopher C. Yang
2020 arXiv   pre-print
The complexities associated with graph and subgraph isomorphism problems, as the core of frequent subgraph mining, have direct impacts on the performance of motif discovery algorithms.  ...  In this paper, we provide a survey of motif discovery algorithms proposed in the literature for mining static and temporal networks and review the corresponding algorithms based on their adopted strategies  ...  Acknowledgment This work was supported in part by the National Science Foundation under the Grant NSF-1741306, IIS-1650531, and DIBBs-1443019.  ... 
arXiv:2005.09721v1 fatcat:m7ytgi2kajcsdoj2cgz2nba6uy

OASiS: A Programming Framework for Service-Oriented Sensor Networks

Manish Kushwaha, Isaac Amundson, Xenofon Koutsoukos, Sandeep Neema, Janos Sztipanovits
2007 2007 2nd International Conference on Communication Systems Software and Middleware  
Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in order to monitor spatio-temporal  ...  Applications are realized as graphs of modular services and executed in response to the detection of physical phenomena.  ...  The heat source follows the trajectory along the path shown in the figure. The path is a straight line from [180, 180] to [670, 670] with Gaussian process noise (N [0, 10]).  ... 
doi:10.1109/comswa.2007.382431 dblp:conf/comsware/KushwahaAKNS07 fatcat:ou6cpsltmbgcxcyv4b4krk5gra

Flow Motifs in Interaction Networks [article]

Chrysanthi Kosyfaki, Nikos Mamoulis, Evaggelia Pitoura, Panayiotis Tsaparas
2018 arXiv   pre-print
In addition, we design a dynamic programming module that finds the instance with the maximum flow.  ...  Many real-world phenomena are best represented as interaction networks with dynamic structures (e.g., transaction networks, social networks, traffic networks).  ...  The distinctive feature of our flow motifs is that, in a flow motif instance, multiple edges of the graph can instantiate a single edge of the motif, if they satisfy the order constraint with the edges  ... 
arXiv:1810.08408v1 fatcat:7sxzyz5z4jbwhavppdriifpmcy

Network-Based Approaches in Drug Discovery and Early Development

J M Harrold, M Ramanathan, D E Mager
2013 Clinical Pharmacology and Therapeutics  
Identification of novel targets is a critical first step in the drug discovery and development process.  ...  Coupling genomics, proteomics, and metabolomics databases with systems pharmacology modeling may aid in the development of disease-specific networks that can be further used to build confidence in target  ...  Support from the National Multiple Sclerosis Society (grants RG3743 and RG4836-A-5) and the Department of Defense Multiple Sclerosis Program (grant MS090122) to the Ramanathan laboratory is gratefully  ... 
doi:10.1038/clpt.2013.176 pmid:24025802 pmcid:PMC4701200 fatcat:qnpv42ouhvbn7mainxtmq4imqq

Fast, Ad Hoc Query Evaluations over Multidimensional Geospatial Datasets

Matthew Malensek, Sangmi Pallickara, Shrideep Pallickara
2017 IEEE Transactions on Cloud Computing  
Pallickara are with the  ...  This study investigates the challenges associated with providing approximate or exploratory answers to distributed queries.  ...  In our benchmarks, the test dataset spans a billion files, each of which contain multiple feature values for specific locations. • We allow discovery of attribute ranges across multidimensional feature  ... 
doi:10.1109/tcc.2015.2398437 fatcat:jxq6pz7szratjjcct4whnjvm54
« Previous Showing results 1 — 15 out of 11,368 results