• Structural Engineering and Mechanics
• /
• v.12 no.5
• /
• pp.507-526
• /
• 2001

In standard finite element algorithms, the local stability conditions are not accounted for in the formulation of the tangent stiffness matrix. As a result, the loss of the local stability is not adequately related to the onset of the global instability. The phenomenon typically arises with material-type localizations, such as shear bands and plastic hinges. This paper addresses the problem in the context of the planar, finite-strain, rate-independent, materially non-linear beam theory, although the proposed technology is in principle not limited to beam structures. A weak formulation of Reissner's finite-strain beam theory is first presented, where the pseudocurvature of the deformed axis is the only unknown function. We further derive the local stability conditions for the large deformation case, and suggest various possible combinations of the interpolation and numerical integration schemes that trigger the simultaneous loss of the local and global instabilities of a statically determined beam. For practical applications, we advice on a procedure that uses a special numerical integration rule, where interpolation nodes and integration points are equal in number, but not in locations, except for the point of the local instability, where the interpolation node and the integration point coalesce. Provided that the point of instability is an end-point of the beam-a condition often met in engineering practice-the procedure simplifies substantially; one of such algorithms uses the combination of the Lagrangian interpolation and Lobatto's integration. The present paper uses the Galerkin finite element discretization, but a conceptually similar technology could be extended to other discretization methods.

• Wind and Structures
• /
• v.14 no.4
• /
• pp.301-319
• /
• 2011

The full-scale measurements are compared with the wind tunnel test results for the long-span roof latticed spatial structure of Shenzhen Citizen Center. A direct comparison of model testing results to full-scale measurements is always desirable, not only in validating the experimental data and methods but also in providing better understanding of the physics such as Reynolds numbers and scale effects. Since the quantity and location of full-scale measurements points are different from those of the wind tunnel tests taps, the weighted proper orthogonal decomposition technique is applied to the wind pressure data obtained from the wind tunnel tests to generate a time history of wind load vector, then loads acted on all the internal nodes are obtained by interpolation technique. The nodal mean wind pressure coefficients, root-mean-square of wind pressure coefficients and wind pressure power spectrum are also calculated. The time and frequency domain characteristics of full-scale measurements wind load are analyzed based on filtered data-acquisitions. In the analysis, special attention is paid to the distributions of the mean wind pressure coefficients of center part of Shenzhen Citizen Center long-span roof spatial latticed structure. Furthermore, a brief discussion about difference between the wind pressure power spectrum from the wind tunnel experiments and that from the full-scale in-site measurements is compared. The result is important fundament of wind-induced dynamic response of long-span spatial latticed structures.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.219-227
• /
• 2008

As found in research on constraint satisfaction problems, the choice of variable ordering heuristics is crucial for effective solving of constraint optimization problems. For the special problems such as energy-efficient clustering in heterogeneous wireless sensor networks, in which cluster heads have an inclination to be near a base station, we propose a new approach based on the static preferences variable orderings and provide a pnode heuristic algorithm for a specific application. The pnode algorithm selects the next variable with the highest Preference. In our problem, the preference becomes higher when the cluster heads are closer to the optimal region, which can be obtained a Priori due to the characteristic of the problem. Since cluster heads are the most dominant sources of Power consumption in the cluster-based sensor networks, we seek to minimize energy consumption by minimizing the maximum energy dissipation at each cluster heads as well as sensor nodes. Simulation results indicate that the proposed approach is more efficient than other methods for solving constraint optimization problems with static preferences.

• Steel and Composite Structures
• /
• v.37 no.6
• /
• pp.663-678
• /
• 2020

This paper proposes a novel topology optimization method generating multiple materials for external linear plane crack structures based on the combination of IsoGeometric Analysis (IGA) and eXtended Finite Element Method (X-FEM). A so-called eXtended IsoGeometric Analysis (X-IGA) is derived for a mechanical description of a strong discontinuity state's continuous boundaries through the inherited special properties of X-FEM. In X-IGA, control points and patches play the same role with nodes and sub-domains in the finite element method. While being similar to X-FEM, enrichment functions are added to finite element approximation without any mesh generation. The geometry of structures based on basic functions of Non-Uniform Rational B-Splines (NURBS) provides accurate and reliable results. Moreover, the basis function to define the geometry becomes a systematic p-refinement to control the field approximation order without altering the geometry or its parameterization. The accuracy of analytical solutions of X-IGA for the crack problem, which is superior to a conventional X-FEM, guarantees the reliability of the optimal multi-material retrofitting against external cracks through using topology optimization. Topology optimization is applied to the minimal compliance design of two-dimensional plane linear cracked structures retrofitted by multiple distinct materials to prevent the propagation of the present crack pattern. The alternating active-phase algorithm with optimality criteria-based algorithms is employed to update design variables of element densities. Numerical results under different lengths, positions, and angles of given cracks verify the proposed method's efficiency and feasibility in using X-IGA compared to a conventional X-FEM.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.219-226
• /
• 2006

The shortest path is only maintained during short time because network topology changes very frequently and each mobile nodes communicate each other by depending on battery in MANET(Mobile Ad-hoc Network). So many researches that are to overcome a limitation or consider a power have executed actively by many researcher. But these protocols are considered only one side of link stability or power consumption so we can make high of stability but power consumption isn't efficient. And also we can reduce power consumption of network but the protocol can't make power consumption of balancing. For that reason we suggest RBSSPR(Residual Battery Capacity and Signal Strength Based Power-aware Routing Protocol in MANET). The RBSSPR considers residual capacity of battery and signal strength so it keeps not only a load balancing but also minimizing of power consumption. The RBSSPR is based on AODV(Ad-hoc On-demand Distance Vector Routing). We use ns-2 for simulation. This simulation result shows that RBSSPR can extense lifetime of network through distribution of traffic that is centralized into special node and reducing of power consumption.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.255-264
• /
• 2011

A sensor network is a special network that makes physical data sensed by sensor nodes and manages the data. The sensor network is a technology that can apply to many parts of field. It is very important to transmit the data to a user at real-time. The core of the sensor network is a sensor node and small operating system that works in the node. TinyOS developed by UC Berkeley is a sensor network operating system that used many parts of field. It is event-driven and component-based operating system. Basically, it uses non-preemptive scheduler. If an urgent task needs to be executed right away while another task is running, the urgent one must wait until another one is finished. Because of that property, it is hard to guarantee real-time requirement in TinyOS. According to recent study, Priority Level Scheduler, which can let one task preempt another task, was proposed in order to have fast response in TinyOS. It has restrictively 5 priorities, so a higher priority task can preempt a lower priority task. Therefore, this paper suggests Preemptive EDF(Earliest Deadline First) Scheduler that guarantees a real-time requirement and reduces average respond time of user tasks in TinyOS.

• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.9
• /
• pp.5095-5099
• /
• 2013

Background: The overall incidence of breast cancer in South Asian countries, including Nepal, is low compared to Western countries. However, the incidence of breast cancer among young women is relatively high. Breast cancer in such cases is characterized by a relatively unfavorable prognosis and unusual pathological features. The aim of this study was to investigate clinico-pathological and biological characteristics in younger breast cancer patients (<40 years) and compare these with their older counterparts. Materials and Methods: Nine hundred and forty four consecutive female breast cancer patients, admitted to the Department of Surgery, Tribhuvan University Teaching Hospital, Kathmandu, Nepal between November 1997 and October 2012, were retrospectively analyzed. Results: Out of the 944 female breast cancer patients, 263 (27.9%) were <40 years. The mean age was $34.6{\pm}5.0$ years among younger patients compared to $54.1{\pm}9.9$ for those ${\geq}40$ years. The mean age at menarche was also significantly lower ($13.5{\pm}1.5$ vs $14.2{\pm}1.5$ years p=0.001) while the mean duration of symptoms was significantly longer (7.6 vs 6.5 months p=0.004). Family history of breast cancer was evident in 3.0% of the young women versus 0.3% in the older one. Mammography was performed less frequently in younger patients (59.7%), compared to older (74.4%), and was of diagnostic benefit in only 20% of younger patients compared to 85% of older ones. At diagnosis, the mean tumor diameter was significantly larger in young women ($5.0{\pm}2.5$ vs $4.5{\pm}2.4cm$, p=0.005). Axillary lymph nodes were positive in 73% of younger patients and 59% of older patients. In the younger group, the proportion of stage III or IV disease was higher (55.1% vs 47.1%, $p{\leq}0.05$). The proportion of breast conserving surgery was higher in young patients (25.1% vs 8.7%) and a higher proportion of younger patients receive neoadjuvant chemotherapy (9.9% vs 2.8%). The most common histological type was ductal carcinoma (93.1% vs 86%). The proportion of histological grade II or III was higher in younger patients (55.9% vs 24.5%). Similarly, in the younger group, lymphatic and vascular invasion was more common (63.2% vs 34.3% and 39.8% vs 25.4%, respectively). Patients in the younger age group exhibited lower estrogen and/or progesterone receptor positivity (34.7% vs 49.8%). Although statistically not significant, the proportion of triple negative tumors in younger age group was higher (22.4% vs 13.6%). Conclusions: Breast cancer in young Nepalese women represents over one quarter of all female breast cancers, many being diagnosed at an advanced stage. Tumors in young women exhibit more aggressive biological features. Hence, breast cancer in young women is worth special attention for earlier detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1302-1308
• /
• 2005

Propose Cellular-IP/PRC network with united paging and Cellular IP special duality that use roof information administration cache to secure lake acceptance method in wireless Internet environment and QoS in lesser extent cell environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and moat of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.79-93
• /
• 2009

For developing the location based service which is individualized and specialized according to the characteristic of the users, the spatio-temporal pattern mining for extracting the meaningful and useful patterns among the various patterns of the mobile object on the spatio-temporal area is needed. Thus, in this paper, as the practical application toward the development of the location based service in which it is able to apply to the real life through the pattern mining from the huge historical data of mobile object, we are proposed STOMP(using Frequency of sequence and Weight) that is the new mining method for extracting the patterns with spatial and temporal constraint based on the problems of mining the optimal moving pattern which are defined in STOMP(F)[25]. Proposed method is the pattern mining method compositively using weighted value(weights) (a distance, the time, a cost, and etc) for our previous research(STOMP(F)[25]) that it uses only the pattern frequent occurrence. As to, it is the method determining the moving pattern in which the pattern frequent occurrence is above special threshold and the weight is most a little bit required among moving patterns of the object as the optimal path. And also, it can search the optimal path more accurate and faster than existing methods($A^*$, Dijkstra algorithm) or with only using pattern frequent occurrence due to less accesses to nodes by using the heuristic moving history.