This paper considers the problem of inferring a graph from the numbers of occurrences of vertex-labeled paths, which is closely related to the pre-image problem for graphs: to reconstruct a graph from its feature space representation. It is shown that both exact and approximate versions of the problem can be solved in polynomial time in the size of an output graph by using dynamic programming a...

This paper considers the problem of inferring a graph from the numbers of occurrences of vertex-labeled paths, which is closely related to the pre-image problem for graphs: to reconstruct a graph from its feature space representation. It is shown that both exact and approximate versions of the problem can be solved in polynomial time in the size of an output graph by using dynamic programming a...

Dynamic Voltage Scaling requires a model of the critical path to allow the proper setting of the supply voltage to meet a target frequency. In this paper, we propose a new technique to model the supply and delay relationship of a critical path which is based on Gaussian Radial Basis Functions (RBF) neural network. This modeling technique is able to successfully capture the process and temperatu...

The present paper analyzes radio signal propagation in long tunnels with different cross sectional size and shape at various signal carrier frequencies, transmitter/receiver positions and material properties applying computer simulations. The influences of different parameters were investigated and results were compared to the empirical four-slope path loss model for long tunnels. It was shown ...

The supermode noise of a harmonically mode-locked erbium-doped fiber laser with composite cavity is investigated both theoretically and experimentally. We propose a simple model based on the transfer function of the composite cavity. From this model, the frequencies of the cavity modes and their frequency-dependent losses are determined. A comprehensive experimental study of the composite cavit...

This paper considers the problem of inferring a graph from the numbers of occurrences of vertex-labeled paths, which is closely related to the pre-image problem for graphs: to reconstruct a graph from its feature space representation. It is shown that both exact and approximate versions of the problem can be solved in polynomial time in the size of an output graph by using dynamic programming a...

This is an investigation of stochastic choice when only the average of the choices is observable. For example when one observes aggregate sales numbers from a store, but not the frequency with which each item was purchased. The focus of our work is on the Luce model, also known as the Logit model. We show that a simple path independence property of average choice uniquely characterizes the Luce...

At 14:30 I will give a short introduction to my thesis You are most welcome to attend the introduction, the defense and the reception afterwards. Abstract Tunable on-chip Radio Frequency (RF) filtering is highly desirable for cost effective wireless communication devices. As mobile wireless devices increasingly support multiple RF-bands, tunable RF filtering is wanted. The tremendous growth of ...

one of the most important factors that affects on job producitivity refers to personnel. motivation and job satisfaction (j.s) explain the reason and cause of human behavior in organization. then the study of this topic will be very important. in this paper causal model of efficient factors of job satisfaction developed by path analysis model. in this paper path analysis model have explained di...

During childhood, brain structure and function changes substantially. Recently, graph theory has been introduced to model connectivity in the brain. Small-world networks, such as the brain, combine optimal properties of both ordered and random networks, i.e., high clustering and short path lengths. We used graph theoretical concepts to examine changes in functional brain networks during normal ...