-
公开(公告)号：WO2017160069A1
公开(公告)日：2017-09-21
申请号：PCT/KR2017/002765
申请日：2017-03-14
Applicant: 재단법인 의약바이오컨버젼스연구단 , 연세대학교 산학협력단
IPC: C07D231/42 , A61K31/4152 , A61K31/18
CPC classification number: A61K31/18 , A61K31/4152 , C07D231/42
Abstract: 본 발명은 신규한 벤젠설폰아미드 유도체 또는 이의 약학적으로 허용가능한 염 및 이의 용도에 관한 것으로, 보다 상세하게는 mTORC1(Mammalian target of rapamycin complex 1) 저해 효과를 갖는 신규한 벤젠설폰아미드 유도체 및 이를 유효성분으로 포함하는 약학적 조성물에 관한 것이다. 본 발명에 따른 화학식 1의 벤젠설폰아미드 유도체는 LRS와 RagD 간의 결합을 저해하여 mTORC1의 활성화를 억제하는 효과가 매우 우수하므로, mTOR를 저해함으로써 치료효과가 달성될 수 있는 암, 간질, 염증질환, 면역질환, 당뇨, 비만, 호흡기계 폐쇄성 질환, 섬유증, 품페병, 리소좀 축적질환(lysosomal storage disease), 알츠하이머 질환, 파킨슨 질환 및 헌팅턴 질환과 같은 신경퇴행성 질환, 심혈관계질환 및 기생충 감염증으로 이루어진 군에서 선택된 어느 한 질환의 예방 또는 치료제 개발에 매우 유용하게 활용될 수 있다.
Abstract translation:
新发明具有新颖苯磺酰胺衍生物或其药学上可接受的盐和涉及它们的用途，更特别的mTORC1的抑制活性（雷帕霉素复合物1的哺乳动物靶标） 苯磺酰胺衍生物和包含苯磺酰胺衍生物作为活性成分的药物组合物。 根据本发明的通式（I）的苯磺酰胺衍生物，LRS等抑制抑制mTORC1的活化的的RagD之间的结合非常优异的效果，通过抑制mTOR的癌症治疗效果可以实现，癫痫症，炎性病症， 自体免疫疾病，糖尿病，肥胖症，呼吸道阻塞性疾病，纤维化，产品pebyeong，溶酶体蓄积疾病（溶酶体贮积病），阿尔茨海默氏病，帕金森氏病和神经变性疾病如亨廷顿氏病，包括心血管疾病和寄生虫感染的一组 它可以用于预防或治疗选定的疾病。
-
公开(公告)号：WO2020213913A1
公开(公告)日：2020-10-22
申请号：PCT/KR2020/005011
申请日：2020-04-14
Applicant: 연세대학교 산학협력단
Abstract: 본 발명은 GSTT1(glutathione S-transferases theta 1) 단백질 또는 이를 암호화하는 유전자를 유효성분으로 포함하는 조성물에 관한 것으로서, STAT3와 p38/JNK의 인산화를 통해 점막 장벽의 면역반응을 유도함으로써, 염증성 장질환의 예방 또는 치료에 매우 효과적으로 사용될 수 있다. 나아가, 상기 세포신호전달을 조절하는 GSTT1 단백질의 이량체가 낮은 수준으로 존재하는지 여부를 측정함으로써 염증성 장질환을 매우 효과적으로 예측할 수 있다.
-
公开(公告)号：KR1020080051035A
公开(公告)日：2008-06-10
申请号：KR1020070102763
申请日：2007-10-11
Applicant: 한국전자통신연구원 , 연세대학교 산학협력단
CPC classification number: H04W40/20 , H04L41/0833 , H04L45/122 , H04W74/0841 , H04W84/18 , Y02D70/00
Abstract: A position-based routing method by using a cell in a wireless sensor network is provided to minimize the energy and to determine a path until a destination node easily by reducing the periodical communication for the position information confirmation. In a next-hop position calculation process, the virtual ONI(Optimal Next-hop Information) among the paths until the destination node is calculated. In a communication area division process(302), the communication area is divided into fixed cell sizes by using the calculated virtual ONI position. In a packet broadcasting process(303), a packet including the virtual ONI position and the cell sizes is broadcasted to the surrounding node in the communication area. In a next-hop node decision process(305), the firstly transmitted surrounding node is determined as the next-hop node after receiving a response message in regard to the broadcasted packet from the surrounding node. In the next-hop position calculation process, the position joined by the virtual segment for connecting the distance until the destination node and a virtual circle corresponding to one's own communication area is calculated and the calculating result is determined as the next hop position.
Abstract translation: 提供了一种通过使用无线传感器网络中的小区的基于位置的路由方法来最小化能量并且通过减少用于位置信息确认的周期性通信来容易地确定目的地节点之间的路径。 在下一跳位置计算处理中，直到计算目的地节点为止的路径中的虚拟ONI（最佳下一跳信息）。 在通信区域划分处理（302）中，通过使用计算出的虚拟ONI位置将通信区域分割成固定小区大小。 在分组广播处理（303）中，将包含虚拟ONI位置和小区大小的分组广播到通信区域中的周边节点。 在下一跳节点决策处理（305）中，首先发送的周围节点在接收到来自周围节点的广播分组的响应消息后被确定为下一跳节点。 在下一跳位置计算处理中，计算通过用于连接目的地节点的距离的虚拟段和与自己的通信区域对应的虚拟圆所连接的位置，并将计算结果确定为下一跳位置。
-
公开(公告)号：KR100695333B1
公开(公告)日：2007-03-16
申请号：KR1020060025624
申请日：2006-03-21
Applicant: 한국전자통신연구원 , 연세대학교 산학협력단
Abstract: A topology management method using a dynamic preliminary cluster head in a wireless network is provided to be capable of minimizing frequent re-clustering processes due to various topology changes, through a dynamic preliminary cluster head technique, thus an overhead is minimized while overall duration and performance of the network can be maximized. Each node confirms neighboring nodes located within a single home range through received hello messages(201). Each node calculates self weight in consideration of the remaining amount of a battery and node density(connectivity)(202). Each node broadcasts hello messages which include the weight(203), and selects a node having the highest weight as a cluster head(204). The selected cluster head broadcasts a hello message which includes a cluster ID, configures weight maps by using a prediction technique based on the hello messages of the other general nodes, and selects a node having the highest weight map as a preliminary cluster head(205). The cluster head broadcasts a hello message which includes a preliminary cluster head ID(206), and compares the weight map with a load balancing threshold value(207). If the weight map is larger, a cluster member calculates a hop count from the cluster head through the received hello message, and selects a cluster having a small hop count as a self cluster(209).
Abstract translation: 提供了一种使用无线网络中的动态初始群集头的拓扑管理方法，通过动态初步群集头技术，能够最大限度地减少由于各种拓扑变化引起的频繁重新聚类过程，从而将开销最小化，同时保持总体持续时间和性能 的网络可以最大化。 每个节点通过接收到的hello消息（201）确认位于单个归属范围内的相邻节点。 每个节点考虑到电池的剩余量和节点密度（连通性）（202）来计算自重。 每个节点广播包括权重（203）的hello消息，并且选择具有最高权重的节点作为簇头（204）。 所选择的集群头广播包括集群ID的一个hello消息，通过使用基于其他通用节点的hello消息的预测技术来配置权重映射，并且选择具有最高权重映射的节点作为初始簇头（205） 。 集群头广播包含初步的集群头ID（206）的一个hello消息，并将权重映射与负载均衡阈值（207）进行比较。 如果权重映射较大，则集群成员通过接收到的hello消息从簇头计算跳数，并选择具有小跳数的集群作为自身集群（209）。
-
公开(公告)号：KR100954380B1
公开(公告)日：2010-04-26
申请号：KR1020070102763
申请日：2007-10-11
Applicant: 한국전자통신연구원 , 연세대학교 산학협력단
Abstract: A position-based routing method by using a cell in a wireless sensor network is provided to minimize the energy and to determine a path until a destination node easily by reducing the periodical communication for the position information confirmation. In a next-hop position calculation process, the virtual ONI(Optimal Next-hop Information) among the paths until the destination node is calculated. In a communication area division process(302), the communication area is divided into fixed cell sizes by using the calculated virtual ONI position. In a packet broadcasting process(303), a packet including the virtual ONI position and the cell sizes is broadcasted to the surrounding node in the communication area. In a next-hop node decision process(305), the firstly transmitted surrounding node is determined as the next-hop node after receiving a response message in regard to the broadcasted packet from the surrounding node. In the next-hop position calculation process, the position joined by the virtual segment for connecting the distance until the destination node and a virtual circle corresponding to one's own communication area is calculated and the calculating result is determined as the next hop position.
-
Patent Agency Ranking
公开(公告)号：KR1020100070233A
公开(公告)日：2010-06-25
申请号：KR1020080128863
申请日：2008-12-17
Applicant: 엘지디스플레이 주식회사 , 연세대학교 산학협력단
IPC: G03F7/00 , H01L21/027 , B82B1/00 , B82B3/00
CPC classification number: G03F7/0002 , B82Y40/00
Abstract: PURPOSE: A nano wire alignment method using a self-assembling method is provided to easily align nano wires by forming a pattern or a structure using lights, and to mass-produce the nano wires by applying the method to a successive pattern forming method. CONSTITUTION: A nano wire alignment method using a self-assembling method comprises the following steps: supplying a substrate(10); forming a PDMS pattern(14) using a PDMS stamp(12) for a photo-stamping process on the substrate; forming a monomolecular membrane by dipping the substrate formed with the PDMS pattern on a SAMs solution; and aligning nano wires on the monomolecular membrane on the substrate. The photo-stamping process is performed by arranging the PDMS stamp with a protrusion(12a) on the substrate, and irradiating UV rays after micro-contacting the protrusion to the substrate.
Abstract translation: 目的：提供使用自组装方法的纳米线对准方法，以通过使用光形成图案或结构来容易地对准纳米线，并且通过将该方法应用于连续图案形成方法来批量生产纳米线。 构成：使用自组装方法的纳米线对准方法包括以下步骤：供给衬底（10）; 使用PDMS印模（12）在衬底上形成用于光刻工艺的PDMS图案（14）; 通过将形成有PDMS图案的基板浸渍在SAM溶液上形成单分子膜; 并在衬底上的单分子膜上对准纳米线。 通过在衬底上布置具有突起（12a）的PDMS印模，并且在将突起微接触到衬底之后照射紫外线来执行照相印刷工艺。
-
公开(公告)号：KR100885433B1
公开(公告)日：2009-02-24
申请号：KR1020070080230
申请日：2007-08-09
Applicant: 연세대학교 산학협력단
Abstract: A data transmission controlling method of a radio network system minimizing overhead and energy consumption of a node is provided to prolong the live of entire network through the consumption of energy of the node by setting the data transmission frequency about the node. Each node of a radio network system sets up its own level through preamble signal received from a sink node or the other node(211). The first node receives preamble signal from the other node or a sink node and sets up its own level. The first node sets up the critical value of the first node by using the whole buffer value(213). The first node compares data slot and the accumulated critical value(214). The first node converts into the transmission mode(215). The first node transmits the RTS(Request to Send) with the node of the lower level than the first node(217).
-
公开(公告)号：KR1020090015687A
公开(公告)日：2009-02-12
申请号：KR1020070080230
申请日：2007-08-09
Applicant: 연세대학교 산학협력단
CPC classification number: H04W28/14 , H04W52/0209 , H04W74/0833 , Y02D70/00
Abstract: A data transmission controlling method of a radio network system minimizing overhead and energy consumption of a node is provided to prolong the live of entire network through the consumption of energy of the node by setting the data transmission frequency about the node. Each node of a radio network system sets up its own level through preamble signal received from a sink node or the other node(211). The first node receives preamble signal from the other node or a sink node and sets up its own level. The first node sets up the critical value of the first node by using the whole buffer value(213). The first node compares data slot and the accumulated critical value(214). The first node converts into the transmission mode(215). The first node transmits the RTS(Request to Send) with the node of the lower level than the first node(217).
Abstract translation: 提供一种使节点的开销和能耗最小化的无线网络系统的数据传输控制方法，通过设置节点的数据传输频率，通过消耗节点的能量来延长整个网络的直播。 无线电网络系统的每个节点通过从汇聚节点或另一个节点（211）接收的前导信号建立其自身的电平。 第一节点从另一个节点或汇聚节点接收前置信号，并设置其自身的电平。 第一个节点通过使用整个缓冲区值来设置第一个节点的临界值（213）。 第一个节点比较数据时隙和累积临界值（214）。 第一节点转换为传输模式（215）。 第一节点与第一节点（217）的下级节点发送RTS（请求发送）。
-
公开(公告)号：KR1020080110000A
公开(公告)日：2008-12-18
申请号：KR1020070058219
申请日：2007-06-14
Applicant: 연세대학교 산학협력단
IPC: H04L12/28
Abstract: A cluster head selecting method of wireless network capable of saving energy is provided to select the cluster head by using information of a node in the wireless network environment unnecessary to know the energy of the entire node every cluster head election round. The initial energy of a node, the current energy of the node, the number of rounds of current clustering and the node obtain times selected as a cluster head to the current round. The probability that the node is selected as the cluster head is calculated. The cluster head is selected by using the probability. The probability that the node is selected as the cluster head is calculated by using the initial energy of a node, the current energy of the node, the number of rounds of current clustering and the node.
Abstract translation: 提供能够节约能量的无线网络的簇头选择方法，通过使用无线网络环境中的节点的信息，不需要知道每个簇头选举的整个节点的能量来选择簇头。 节点的初始能量，节点的当前能量，当前聚类的轮次数和节点获取时间作为当前轮次的簇头。 计算节点被选为簇头的概率。 通过使用概率来选择簇头。 通过使用节点的初始能量，节点的当前能量，当前聚类和节点的轮次数来计算节点被选择为簇头的概率。
-
公开(公告)号：KR100664685B1
公开(公告)日：2007-01-24
申请号：KR1020050036864
申请日：2005-05-02
Applicant: 연세대학교 산학협력단
IPC: H04L12/28
Abstract: 본 발명은 무선 네트워크에서의 점진적 패킷 포워딩 경로 결정 방법에 관한 것이다.
본 발명의 경로 결정 방법은, 무선 네트워크에서 이웃 노드들 중 목적지 노드에 가장 가까이 위치한 노드로의 패킷 전송을 통해 점진적으로 패킷을 포워딩할 수 있도록 하는 라우팅 경로 결정 방법으로서, 소스 노드가 자신과 인접한 원-홉(One-Hop) 이웃 노드들로 목적지 노드의 위치값을 전송하는 제1단계와; 목적지 노드 위치값을 수신한 각 노드들이 자신 노드와 목적지 노드 간의 거리를 계산하고, 일정한 기준에 따라 각자 구한 거리에 비례하는 지연시간을 결정하고 결정된 지연시간만큼 타이머를 구동하는 제2단계와; 상기 타이머를 구동한 이웃 노드들 중 지연시간이 가장 적은 어느 하나의 이웃 노드가 타이머 구동을 완료한 후 소스 노드로 응답하고, 상기 소스 노드가 목적지 노드 위치값을 전송한 이웃 노드들 중 가장 먼저 응답한 노드로 응답 수락 메시지를 전송하는 제3단계와; 상기 응답 수락 메시지를 수신한 노드가 목적지 노드가 아닌 경우, 상기 응답 수락 메시지를 수신한 노드가 다시 다음 홉 노드들로 목적지 위치 값을 전송하고 상기 제2단계로 궤환하며, 상기 응답 수락 메시지를 수신한 노드가 목적지 노드인 경우, 경로 결정 과정을 종료하는 제4단계; 를 포함하여 이루어짐에 기술적 특징이 있다.Abstract translation: 提供了一种用于逐渐确定无线网络中的分组转发路径的方法，以有效地使用能量并减少延迟时间。 当源节点将目的地的位置值发送到一跳邻居节点（S101）时，每个邻居节点计算到目的地节点的距离（S102），确定与计算出的距离成比例的延迟时间，并且驱动定时器 只要延迟时间（S103）。 当不识别邻居节点的第一响应（S104）时，对应的节点完成定时器的驱动并响应源节点（S105），并且源节点向首先响应的对应节点发送响应接收消息（S105） S106）。 在接收到响应接收消息时，如果对应的节点不是目的地节点，则将目的地的位置值发送到下一跳节点（S107），并且接收目的地的位置值并将响应接受消息发送给 节点（S108）。
-
-
-
-
-
-
-
-
-
Search Results
56
records
(took 0.026 seconds)
