• Wind and Structures
• /
• 제8권5호
• /
• pp.343-356
• /
• 2005

Overhead sign support structures number in the tens of thousands throughout the trunk-line roadways in the United States. A recent two-phase study sponsored by the National Cooperative Highway Research Program resulted in the most significant changes to the AASHTO design specifications for sign support structures to date. The driving factor for these substantial changes was fatigue related cracks and some recent failures. This paper presents the method and results of a subsequent study sponsored by the Michigan Department of Transportation (MDOT) to develop a relative performance-based procedure to rank overhead sign support structures around the United States based on a linear combination of their expected fatigue life and an approximate measure of cost. This was accomplished by coupling a random vibrations approach with six degree-of-freedom linear dynamic models for fatigue life estimation. Approximate cost was modeled as the product of the steel weight and a constructability factor. An objective function was developed and used to rank selected steel sign support structures from around the country with the goal of maximizing the objective function. Although a purely relative approach, the ranking procedure was found to be efficient and provided the decision support necessary to MDOT.

• STI Policy Review
• /
• 제6권2호
• /
• pp.105-145
• /
• 2015

Science, technology and innovation (STI) is crucially important to eradicating poverty, and making advances in various areas such as agriculture, health, environment, transport, industry, and telecommunications. Therefore, it is vital to the overall socioeconomic development of nations. The indispensable role of STI in the competitive globalized economy led to several attempts to measure national STI capacities. The present study outlines STI capacity around three sets of capabilities: technological capabilities, social capabilities, and common capabilities. The Global Science, Technology and Innovation Capacity (GSTIC) index was developed to provide current evidence on the national STI capacities of the countries, and to improve the composite indicators used for such purposes. The GSTIC ranks a large number of countries (167) on the basis of their STI capacities and categories them into four groups: i.e. leaders, dynamic adopters, slow adopters, and laggards. For more meaningful assessment of the STI capacities of nations, it captures the achievement gaps of individual countries with the highest achiever. The study also provides ranking and achievement gaps of nations in the nine GSTIC pillars: technology creation, R&D capacity, R&D performance, technology absorption, diffusion of old technologies, diffusion of recent innovations, exposure to foreign technology, human capital, and enabling factors. A more detailed analysis of the strengths and weaknesses in different pillars of STI capacity of ten selected countries is also provided. The results show that there are significant disparities among nations in STI capacity and its various aspects, and developing countries have much to catch-up with the developed nations. However, different countries may adopt different strategies according to their strengths and weaknesses. Useful insight into the strengths and weaknesses of the national STI capacities of different countries are provided in the study.

• 전자공학회논문지CI
• /
• 제45권1호
• /
• pp.48-54
• /
• 2008

MMORPG 게임 에서는 많은 사용자들이 다수의 서버를 통해 관리 된다. 이러한 환경에서 사용자 수는 몇 명에서 몇 천명에 달할 수 있고 사용자들은 같은 가상 세계에서 서로의 정보를 주고받는 과정에서 여러 가지 문제들, 서버와의 연결 지연이나 끊김 현상 등이 발생 할 수 있다. 이러한 문제는 사용자들이 게임을 즐기는데 있어서 큰 방해가 되며 위와 같은 문제로 인한 명령어 전달이나 메시지 전달이 늦게 되면 사용자는 가상 세계에서 불이익을 받을 수 있다. 많은 정책들이 이와 같은 문제들을 해결하기 위해 자원 여유에 따른 등급에 따라 서버들에 사용자를 배분 하고 있지만 불행히도, 최적의 환경으로 사용자를 서버에 배분 하였다 하더라도 급변하는 서버와 네트워크의 상태 변화로 인해 시간이 지남에 따라 차선책이 되고 만다. 그로 인해 MMORPG 환경에서 원활한 서버 자원 관리가 힘들어 진다. 이러한 문제들을 해결하기 위해 시간 기반의 균등 분할 방법(TIP)를 제안한다. TIP는 게임 유저들을 게임 서버들에 특정 시간마다 균등하게 분할하여 부하 불균형으로 인한 문제점을 해결할 것이다.

• 통합자연과학논문집
• /
• 제16권3호
• /
• pp.81-95
• /
• 2023

Colorectal cancer is one of the most common types of cancer worldwide, ranking third after lung and breast cancer in terms of global prevalence. With an expected 1.93 million new cases and 935,000 deaths in 2020, it is more prevalent in males than in women. Evidence has shown that during the later stages of colon cancer, STAT1 promotes tumor progression by promoting cell survival and resistance to chemotherapy. Recent studies have shown that inhibiting STAT1 pathway leads to a reduction in tumor cell proliferation and growth, and can also promote apoptosis in colon cancer cells. One of the recent approaches in the field of drug discovery is drug repurposing. In drug repurposing approach we have virtually screened FDA database against STAT1 protein and their interactions have been studied through Molecular docking. Cross docking was performed with the top 10 compounds to be more specific with STAT1 comparing the affinity with STAT2, STAT3, STAT4, STAT5a, STAT5b and STAT6. The drugs that showed higher affinity were subjected to Conceptual - Density functional theory. Besides, the Molecular dynamic simulation was also carried out for the selected leads. We also validated in-vitro against colon cancer cell lines. The results showed mainly Acetyldigitoxin has shown better binding to the target. From this study, we can predict that the drug Acetyldigitoxin has shown noticeable inhibitory efficiency against STAT1, which in turn can also lead to the reduction of tumor cell growth in colon cancer.

• 방송공학회논문지
• /
• 제14권2호
• /
• pp.238-252
• /
• 2009

방송과 융합의 시대로 접어들면서 (IP)TV 단말에서 이용 가능한 프로그램 콘텐츠 수가 급격히 증가 하였다. 이로 인해, 사용자 (시청자)가 선호하는 방송 프로그램 콘텐츠로의 접근성이 주요한 사항이 되었다. 본 논문은 유사 사용자 선호도에 기반을 둔 협업 필터링을 이용하여(IP)TV 프로그램을 효율적으로 사용자에게 자동 추천하는 연구에 관한 내용이다. 개인의 시청 프로그램 선호도를 고려하여 방송 프로그램을 추천하기 위해서, 제안하는 추천 시스템의 구성은 오프라인과 온라인 연산으로 구성된다. 오프라인 연산과정에서 (IP)TV 프로그램, 장르, 채널에 대한 개인의 선호도를 묵시적으로 추론 하는 방법을 제시하고, 동적 퍼지 클러스터링 방법을 사용하여 각 개인의 선호도에 따라 사용자들을 그룹 짓되, 특징 벡터를 장르와 채널에 대한 선호도로 결합하여 사용하는 방법을 제시한다. 또한, (IP)TV 단말에 로그인 한 활동 사용자에게, 높은 정확도로 선호 프로그램을 추천하기 위해서, 활동 사용자와 관심 시청 프로그램이 유사한 사용자들을 유사도 측정 방법을 사용하여 한 번 더 추출하고, 이 추출된 유사 취향 사용자들의 선호 (IP)TV 프로그램들에 대해, EPG를 이용하여 현재 방송되지 않는 프로그램들을 제외시킨다. 마지막 단계에서는 추천 후보 프로그램들에 대해 본 논문에서 제안하는 순위 정렬 모델을 이용하여 추천 우선순위를 결정하여 제시한다. 특별히, 본 논문은 BM(Best Match) 알고리즘을 확장하여 개인 선호도를 고려한 순위 정렬 모델을 제시한다. 실험을 통해, 본 논문에서 제안한 프로그램 자동 추천 알고리듬은 2,441명의 사용자에 대해 5개의 프로그램을 추천하였을 경우, 62.1%의 예측 정확도를 나타내었다.

• 정보처리학회논문지A
• /
• 제17A권5호
• /
• pp.229-236
• /
• 2010

인터넷이나 기업체 안에서 생성되는 문서의 수가 빠르게 증가하고 있고 이에 따라 효율적인 문서 검색 서비스의 중요성도 함께 커지고 있다. 이런 검색 환경에서 사용자의 검색 질의를 미리 예측할 수 없기 때문에 문서 내의 키워드를 자동 추출하여 색인어로 사용하는 전문검색(full-text search)이 일반적으로 적용된다. 전문검색을 위해 생성된 색인 파일의 크기는 문서 수 증가로 대용량화 되고, 이런 대용량 색인에 대한 다중 키워드 질의 처리에는 과도한 디스크 비용이 초래될 수 있다. 논문에서는 이런 비용 문제를 해결하기 위해 대용량 문서의 전문검색 시스템에서 다중 키워드 질의를 효율적으로 처리할 수 있게 하는 색인 파일 구조 및 관리 기법을 제안한다. 제안된 방법은 다중 키워드 검색에 적합한 것으로 알려진 역파일을 기본 색인 구조로 하며, 질의 처리의 조인 연산과 랭킹 연산에 적합하도록 색인 파일을 계층화한다. 이를 바탕으로 다중 키워드 질의를 구성할 확률이 높은 키워드 쌍에 대한 조인 연산 결과를 주기억장치 공간에 동적으로 저장함으로써 디스크 사용량을 크게 줄일 수 있다. 논문에서는 제안된 기법의 우수성을 보이기 위해 디스크 비용 모델에 기반한 성능 비교도 수행한다.

• Asia pacific journal of information systems
• /
• 제18권1호
• /
• pp.79-96
• /
• 2008

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.