This article reports on a study that investigates the knowledge transfer between an information systems/ technology (IS/IT) department and non-IT departments during IT projects. More specifically, we look into the link between the knowledge management capabilities of the IT department and the effectiveness and efficiency of the knowledge transfer to a client department. Knowledge management (KM...

The most common problem on routing networks is to compute the shortest paths from a source vertex set of target vertices. A variation it, with applications for recommender systems, asks merely rank vertices respect distances source. classic solution Dijkstra’s algorithm; however, it too slow large but meaningful applications. setting where are fixed only known at query time allows preprocessing...

Abstract We present a quantitative estimate for the radially symmetric configuration concerning Serrin-type overdetermined problem torsional rigidity in bounded domain Ω ⊂ R N , when equation is known on  ∖ ω ¯ only, some open subset  ⋐ . The has concrete motivations optimal heating with malfunctioning, laminar flows and beams small inhomogeneities.

Domain generation algorithms (DGAs) can be categorized into three types: zero-knowledge , xmlns:xlink="http://www.w3.org/1999/xlink">partial-knowledge and xmlns:xlink="http://www.w3.org/1999/xlink">full-knowledge . While prior research merely focused on types, we characterize their anti...

Abstract The partial evaluation and assembly framework has recently been applied for processing subgraph matching queries over large-scale knowledge graphs in the distributed environment. is implemented on master-slave architecture, endowed with outstanding scalability. However, there are two drawbacks of evaluation: if volume intermediate results large, a large number repeated matches will be ...