中国科学院数学与系统科学研究院期刊网

2008年, 第21卷, 第4期 刊出日期:2008-12-20
  

  • 全选
    |
    论文
  • Tingting XIAO;Ke LIU;Kin Keung LAI
    Journal of Systems Science and Complexity. 2008, 21(4): 487-518.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Different from traditional tax audit, supervision with self-audit is a combination of audit by the taxpayer himself and audit by the tax authority. This paper mainly studies a taxpayer’s optimal policy of tax evasion under supervision with self-audit and its related properties, in order to deduce some effective suggestions and theoretical bases to restrain tax evasion. Assuming that only a certain proportion of evaded tax can be discovered when the audit is executed, the authors first formulate a static model with self-audit. This model is divided into two stages. At the first stage, taxpayers declare their taxes, then the tax authority chooses audit objects, based on a known
    probability, and announces the result; if the taxpayer is chosen, he will enter the second stage, during which he has a chance to pay the evaded tax and the corresponding late fees and then is audited by the tax authority. The authors show the existence and uniqueness of the optimal amount of tax evasion at the first stage and the optimal proportion to self-expose at the second stage. The authors also discuss the related properties of the interior solution, and do elasticity analyses on some parameters. Besides, the authors extend the static model into the corresponding two-period model, and study the existence and uniqueness of the solution of the extended model. Finally, under the assumption that tax evasion can only be discovered with a certain probability when the audit is executed, the authors formulate another static model with self-audit and investigate its properties.
  • Yunhui XU;Zhongfei LI;Ken Seng TAN
    Journal of Systems Science and Complexity. 2008, 21(4): 519-526.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper investigates the optimal dynamic investment for an investor who maximizes constant absolute risk aversion (CARA) utility in a discrete-time market with a riskfree bond and a risky stock. The risky stock is assumed to present both the dividend risk and the price risk. With our assumptions, the dividend risk is equivalent to fundamental risk, and the price risk is equivalent to the noise trading risk. The analytical expression for the optimal investment strategy is obtained by dynamic programming. The main result in this paper highlights the importance of differentiating between noise trading risk and fundamental risk for the optimal dynamic investment.
  • Lean YU;Shouyang WANG;Fenghua WEN;Kin Keung LAI;Shaoyi HE
    Journal of Systems Science and Complexity. 2008, 21(4): 527-539.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this study, a novel hybrid intelligent mining system integrating rough sets theory and support vector machines is developed to extract efficiently association rules from original information table for credit risk evaluation and analysis. In the proposed hybrid intelligent system, support vector machines are used as a tool to extract typical features and filter its noise, which are different from the previous studies where rough sets were only used as a preprocessor for support vector machines. Such an approach could reduce the information table and generate the final knowledge from the reduced information table by rough sets. Therefore, the proposed hybrid intelligent system overcomes the difficulty of extracting rules from a trained support vector machine classifier and possesses the robustness which is lacking for rough-set-based approaches. In addition, the effectiveness of the proposed hybrid intelligent system is illustrated with two real-world credit datasets.
  • Xiaoya LI;Jinchuan CUI
    Journal of Systems Science and Complexity. 2008, 21(4): 540-557.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper is concerned with the resource allocation problem based on data envelopment analysis (DEA) which is generally found in practice such as in public services and in production process. In management context, the resource allocation has to achieve the {effective-efficient-equality} aim and tries to balance the different desires of two management layers: central manager and each sector. In mathematical programming context, to solve the resource allocation asks for introducing many optimization techniques such as multiple-objective programming and goal programming. We construct an algorithm framework by using comprehensive DEA tools including CCR, BCC models, inverse DEA model, the most compromising common weights analysis model, and extra resource allocation algorithm. Returns to scale characteristic is put major place for analyzing DMUs’ scale economies and used to select DMU candidates before resource allocation. By combining extra resource allocation algorithm with scale economies target, we propose a resource allocation solution, which can achieve the {effective-efficient-equality} target and also provide information for future resource allocation. Many numerical examples are discussed in this paper, which also verify our work.
  • Ai HAN;Yongmiao HONG;K. K. LAI;Shouyang WANG
    Journal of Systems Science and Complexity. 2008, 21(4): 558-573.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Traditional econometrics has long employed ``points" to measure time series data. In real life situations, however, it suffers the loss of volatility information, since many variables are bounded by intervals in a given period. To address this issue, this paper provides a new methodology for interval time series analysis. The concept of ``interval stochastic process" is formally defined as a counterpart of ``stochastic process" in point-based econometrics. The authors introduce the concepts of interval stationarity, interval statistics (including interval mean, interval variance, etc.) and propose an interval linear model to investigate the dynamic relationships between interval processes. A new interval-based optimization approach for estimation is proposed, and corresponding evaluation criteria are derived. To demonstrate that the new interval method provides valid results, an empirical example on the sterling-dollar exchange rate is presented.
  • Kedian MU ;Zhi JIN;Didar ZOWGHI
    Journal of Systems Science and Complexity. 2008, 21(4): 574-596.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Inconsistency of multi-perspective requirements specifications is a pervasive issue during the requirements process. However, managing inconsistency is not just a pure technical problem. It is always associated with a process of interactions and competitions among corresponding stakeholders.The main contribution of this paper is to present a negotiations approach to handling inconsistencies in multi-perspective software requirements. In particular, the priority of requirements relative to each perspective plays an important role in proceeding negotiation over resolving inconsistencies among different stakeholders. An algorithm of generating negotiation proposals and an approach to evaluating proposals are also presented in this paper, respectively.
  • Jian TANG;Liwei ZHENG;Zhi JIN
    Journal of Systems Science and Complexity. 2008, 21(4): 597-608.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Composing web services is gained daily attention in Service Oriented Computing. It includes the dynamic discovery, interaction and coordination of agent-based semantic web services. The authors first follow Function Ontology and Automated Mechanism Design for service agents aggregating. Then the problem is formulated but it is ineffective to solve it from the traditional global view. Because the complexity is NP-complete and it is difficult or even impossible to get some personal information. This paper provides a multi-agent negotiation idea in which each participant negotiates under the condition of its reservation payoff being satisfied. Numerical experiment is given and well evaluates the negotiation.
  • Haixia Du;Terry Yoo;Hong Qin
    Journal of Systems Science and Complexity. 2008, 21(4): 609-625.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Shape skeletonization (i.e., medial axis extraction) is powerful in many visual computing applications, such as pattern recognition, object segmentation, registration, and animation. In this paper, the authors expand the use of diffusion equations combined with distance field information to approximate medial axes of arbitrary 3D solids represented by polygonal meshes based on their differential properties. It offers an alternative but natural way for medial axis extraction for commonly used 3D polygonal models. By solving the PDE along time axis, this system can not only quickly extract diffusion-based medial axes of input meshes, but also allow users to visualize the extraction process at each time step. In addition, the proposed model provides users a set of manipulation toolkits to sculpt extracted medial axes, then use diffusion-based techniques to recover corresponding deformed shapes according to the original input datasets. This skeleton-based shape manipulation offers a fast and easy way for animation and deformation of complicated mesh objects.
  • Jianming ZHU ;Xiaodong HU
    Journal of Systems Science and Complexity. 2008, 21(4): 626-636.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Wireless sensor networks promise a new paradigm for gathering data via collaboration among sensors spreading over a large geometrical region. Many applications impose delay requirements for data gathering and ask for time-efficient schedules for aggregating sensed data and sending to the data sink. In this paper, the authors study the minimum data aggregation time problem under collision-free transmission model. In each time round, data sent by a sensor reaches all sensors within its transmission range, but a sensor can receive data only when it is the only data that reaches the sensor. The goal is to find the method that schedules data transmission and aggregation at sensors so that the time for all requested data to be sent to the data sink is minimal. The authors propose a new approximation algorithm for this NP-hard problem with guaranteed performance ratio $\frac{7\Delta}{\log_2{|\mathsf S|}}+c$, which significantly reduces the current best ratio of $\Delta-1$, where $\mathsf S$ is the set of sensors containing source data, $\Delta$ is the maximal number of sensors within the transmission range of any sensor, and $c$ is a constant. The authors also conduct extensive simulation, the obtained results justify the improvement of proposed algorithm over the existing one.
  • Jiguang WANG ;Yuqing QIU ;Ruisheng WANG;Xiangsun ZHANG
    Journal of Systems Science and Complexity. 2008, 21(4): 637-644.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper discusses a popular community definition in complex network research in terms of the conditions under which a community is minimal, that is, the community cannot be split into several smaller communities or split and reorganized with other network elements into new communities. The result provides a base on which further optimization computation of the quantitative measure for community identification can be realized.
  • Lan XIAO;Guiying YAN;Yuwen WU;Wei REN
    Journal of Systems Science and Complexity. 2008, 21(4): 645-650.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let $G_{n,d}$ be a random \emph{d}-regular graph with \emph{n} vertices, where $d=o(n)$. Given a fixed graph \emph{H}, $Y_{H}$ denotes the number of induced copies of \emph{H} in $G_{n,d}$. In this paper, the authors determine the threshold of the event ``$Y_{H}>0$", and also obtain the induced subgraph counts inside the threshold interval
  • Xiaoguang YANG ;Jianzhong ZHANG
    Journal of Systems Science and Complexity. 2008, 21(4): 651-664.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper discusses the inverse center location problem restricted on a tree with different costs and bound constraints. The authors first show that the problem can be formulated as a series of combinatorial linear programs, then an $O(|V|^2\log|V|)$ time algorithm to solve the problem is presented. For the equal cost case, the authors further give an $O(|V|)$ time algorithm.
  • Lin WANG;Yuqing QIU;Jiguang WANG;Xiangsun ZHANG
    Journal of Systems Science and Complexity. 2008, 21(4): 665-675.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Protein fold structure is more conserved than its amino acid sequence and closely associated with biological function, so calculating the similarity of protein structures is a fundamental problem in structural biology and plays a key role in protein fold classification, fold function inference, and protein structure prediction. Large progress has been made in recent years in this field and many methods for considering structural similarity have been proposed, including methods for protein structure comparison, retrieval of protein structures from databases, and ligand binding site comparison. Most of those methods can be available on the World Wide Web, but evaluation of all the methods is still a hard problem. This paper summarizes some popular methods and latest methods for structure similarities, including structure alignment, protein structure retrieval, and ligand binding site alignment.